Reuse of a related thread&#39;s cache while recording a trace file of code execution

ABSTRACT

Reusing a related thread&#39;s cache during tracing. An embodiment includes executing a first thread at a processing unit while recording a trace to a first buffer. During execution, a context switch from the first thread to a second thread at the same processing unit is detected. Based on the context switch, it is determined that the second thread is related to the first thread, and that it is being traced to a separate second buffer. Based on this determination, a cache of the first thread is reused. The reuse includes recording a first identifier in the first buffer, and recording a second identifier in the second buffer. The first and second identifiers provide a linkage between the first buffer and the second buffer. Execution of the second thread is then initiated, while recording a trace to the second buffer, and without invalidating logging state of a cache.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation-in-part of U.S. patent application Ser. No. 15/433,918, filed Feb. 15, 2017, and titled “FACILITATING RECORDING A TRACE FILE OF CODE EXECUTION USING WAY-LOCKING IN A SET-ASSOCIATIVE PROCESSOR CACHE,” which is a continuation-in-part of U.S. patent application Ser. No. 15/298,439, filed Oct. 20, 2016, and titled “FACILITATING RECORDING A TRACE FILE OF CODE EXECUTION USING A PROCESSOR CACHE,” and which applications are related to U.S. patent application Ser. No. 15/252,998 filed Aug. 31, 2016, and U.S. patent application Ser. No. 15/253,027 filed Aug. 31, 2016. This application is also related to U.S. patent application Ser. No. 15/604,334, titled “FACILITATING RECORDING A TRACE FILE OF CODE EXECUTION USING INDEX BITS IN A PROCESSOR CACHE,” and which is concurrently filed herewith. The entire contents of each of the foregoing applications are incorporated by reference herein in their entireties.

BACKGROUND

When writing code during the development of software applications, developers commonly spend a significant amount of time “debugging” the code to find runtime errors in the code. For example, developers may take several approaches to reproduce and localize a source code bug, such as observing behavior of a program based on different inputs, inserting debugging code (e.g., to print variable values, to track branches of execution, etc.), temporarily removing code portions, etc. Tracking down runtime errors to pinpoint code bugs can occupy a significant portion of application development time.

Many types of debugging applications (“debuggers”) have been developed in order to assist developers with the code debugging process. Many such tools offer developers the ability to trace, visualize, and alter the execution of computer code. For example, debuggers may visualize the execution of code instructions, may present variable values at various times during code execution, may enable developers to alter code execution paths, and/or may enable developers to set “breakpoints” in code (which, when reached during execution, causes execution of the code to be suspended), among other things.

An emerging form of debugging applications enable “time travel,” “reverse,” or “historic” debugging, in which execution of a program is recorded by a trace application into one or more trace files, which can be then be used to replay execution of the program for forward and backward analysis. One factor that can limit a “time travel” debugger's utility is trace file size. For example, a large trace file can consume significant storage resources (which, in turn, can affect an amount of historical execution time that can be kept for a program), can affect performance of both a tracing application and a debugging application, can affect performance of the program being traced, etc.

BRIEF SUMMARY

At least some embodiments described herein relate to systems, methods, and computer program products related to recording a trace file of code execution using a processor cache that includes accounting bits associated with each cache line in the cache. In some embodiments, accounting bits can include index bits that store an index to a processing unit has logged a value of a cache line. As described herein, use of a processor cache that includes accounting bits can enable efficiencies in recording a trace of an application. For example, use of a processor cache that includes accounting bits can enable tracing execution of an application with trace file sizes that can be orders of magnitude smaller than other techniques. Furthermore, using accounting bits in the form of index bits enables the foregoing embodiments to scale to systems that include a great number of processing units (e.g., numbering into the tens, hundreds, or even thousands).

Additionally, some embodiments herein operate to provide additional trace size reductions when recording related threads (e.g., part of the same process) that are executing at the same processing unit to different buffers. In particular, rather than invalidating logging state of a cache during a context switch between related threads, embodiments instead insert identifiers into the two thread's buffers, which then enables one thread to use cache values stored on another thread's buffer during replay. In some environments, this improvement has been observed to further decrease trace file size by around 25%-40%.

At least some embodiments described herein also relate to systems, methods, and computer program products related to recording a trace file of code execution based on use of way-locking on a set-associative processor cache. In particular, embodiments include way-locking a subset of a set-associative processor cache, such that the subset is used exclusively to store cache misses for a specified executable entity (e.g., a thread that is being traced). Since, due to the way-locking, no data relating to other executable entities can be stored in the reserved subset of the cache, logging execution of the executable entity—including all memory consumed by the executable entity—involves logging the data that is stored in the reserved subset of the cache.

In some embodiments, a method for reusing a related thread's cache during tracing includes executing a first thread at a particular processing unit of the one or more processing units while recording a trace of execution of the first thread to a first buffer. The method also includes detecting a context switch from the first thread to a second thread executing at the particular processing unit. The method also includes, based on detecting the context switch, determining that the second thread is related to the first thread and that it is being traced to a second buffer that is separate from the first buffer. The method also includes reusing cache of the first thread, based at least on the second thread being related to the first thread and being traced to the second buffer. This includes recording a first identifier in the first buffer and recording a second identifier in the second buffer, the first and second identifiers providing a linkage between the first buffer and the second buffer. The method also includes initiating execution of the second thread at the particular processing unit while recording a trace of execution of the second thread to the second buffer, and without invalidating logging state of a processor cache.

This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the invention can be obtained, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:

FIG. 1 illustrates an example computing environment that facilitates recording a trace file of program execution using a shared processor cache;

FIG. 2 illustrates an example trace file;

FIG. 3A illustrates an example conventional shared cache;

FIG. 3B illustrates an example shared cache that extends each cache line with additional accounting bits that each corresponds to a different processing unit;

FIG. 3C illustrates an example shared cache that includes, for each cache line, additional accounting bits in the form of a “reference value” portion;

FIG. 4A illustrates an example shared cache that reserves one or more cache lines for storing accounting bits that apply to other cache lines;

FIG. 4B illustrates an example shared cache that stores both unit accounting bits and reference value accounting bits in reserved cache lines;

FIG. 4C illustrates an example shared cache in which accounting bits for two or more cache lines are stored in a reserved cache line, and in which a set of reference value bits are used in connection with multiple sets of unit bits;

FIG. 4D illustrates an example shared cache which uses a reserved cache line to store unit bits and, for each reserved cache line that stores unit bits, uses a separate cache line for each processor to store reference values for that processor;

FIG. 4E illustrates an example hybrid shared cache that adds additional accounting bits to each cache line, and that also uses reserved cache lines for accounting bits;

FIG. 5A illustrates a flowchart of an example method for recording a trace file of program execution using a processor cache that stores unit bits;

FIG. 5B illustrates a flowchart of an example method for recording a trace file of program execution using a processor cache that stores index bits;

FIG. 6 illustrates a flowchart of an example method for recording a trace file of program execution using a processor cache storing reference bits;

FIG. 7A illustrates an example of direct mapping in a cache;

FIG. 7B illustrates an example of set-associative mapping in a cache;

FIG. 8 illustrates expanded of a set-associative cache having reserved ways;

FIG. 9 illustrates a flowchart of an example method for facilitating recording a trace of code execution using a set-associative processor cache;

FIG. 10A illustrates an example timeline diagram corresponding to tracing a single thread into a single buffer;

FIG. 10B illustrates an example timeline diagram corresponding to tracing two related threads executing at a single processing unit into different buffers;

FIG. 10C illustrates another example timeline diagram corresponding to tracing two related threads executing at a single processing unit into different buffers; and

FIG. 11 illustrates a flowchart of an example method for reusing a related thread's cache during tracing.

DETAILED DESCRIPTION

At least some embodiments described herein relate to systems, methods, and computer program products related to recording a trace file of code execution using a processor cache that includes accounting bits associated with each cache line in the cache. In some embodiments, accounting bits can include index bits that store an index to a processing unit has logged a value of a cache line. As described herein, use of a processor cache that includes accounting bits can enable efficiencies in recording a trace of an application. For example, use of a processor cache that includes accounting bits can enable tracing execution of an application with trace file sizes that can be orders of magnitude smaller than other techniques. Furthermore, using accounting bits in the form of index bits enables the foregoing embodiments to scale to systems that include a great number of processing units (e.g., numbering into the tens, hundreds, or even thousands).

Additionally, some embodiments herein operate to provide additional trace size reductions when recording related threads (e.g., part of the same process) that are executing at the same processing unit to different buffers. In particular, rather than invalidating log state of a cache during a context switch between related threads, embodiments instead insert identifiers into the two thread's buffers, which then enables one thread to use cache values stored on another thread's buffer during replay. In some environments, this improvement has been observed to further decrease trace file size by around 25%-40%.

At least some embodiments described herein also relate to systems, methods, and computer program products related to recording a trace file of code execution based on use of way-locking on a set-associative processor cache. In particular, embodiments include way-locking a subset of a set-associative processor cache, such that the subset is used exclusively to store cache misses for a specified executable entity (e.g., a thread that is being traced). Since, due to the way-locking, no data relating to other executable entities can be stored in the reserved subset of the cache, logging execution of the executable entity—including all memory consumed by the executable entity—involves logging the data that is stored in the reserved subset of the cache.

FIG. 1 illustrates an example computing environment 100 that facilitates recording a trace file of program execution using a shared processor cache. As depicted, embodiments may comprise or utilize a special-purpose or general-purpose computer system 101 that includes computer hardware, such as, for example, one or more processors 102, system memory 103, one or more data stores 104, and/or input/output hardware 105.

Embodiments within the scope of the present invention include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by the computer system 101. Computer-readable media that store computer-executable instructions and/or data structures are computer storage devices. Computer-readable media that carry computer-executable instructions and/or data structures are transmission media. Thus, by way of example, and not limitation, embodiments of the invention can comprise at least two distinctly different kinds of computer-readable media: computer storage devices and transmission media.

Computer storage devices are physical hardware devices that store computer-executable instructions and/or data structures. Computer storage devices include various computer hardware, such as RAM, ROM, EEPROM, solid state drives (“SSDs”), flash memory, phase-change memory (“PCM”), optical disk storage, magnetic disk storage or other magnetic storage devices, or any other hardware device(s) which can be used to store program code in the form of computer-executable instructions or data structures, and which can be accessed and executed by the computer system 101 to implement the disclosed functionality of the invention. Thus, for example, computer storage devices may include the depicted system memory 103, the depicted data store 104 which can store computer-executable instructions and/or data structures, or other storage such as on-processor storage, as discussed later.

Transmission media can include a network and/or data links which can be used to carry program code in the form of computer-executable instructions or data structures, and which can be accessed by the computer system 101. A “network” is defined as one or more data links that enable the transport of electronic data between computer systems and/or modules and/or other electronic devices. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer system, the computer system may view the connection as transmission media. Combinations of the above should also be included within the scope of computer-readable media. For example, the input/output hardware 105 may comprise hardware (e.g., a network interface module (e.g., a “NIC”)) that connects a network and/or data link which can be used to carry program code in the form of computer-executable instructions or data structures.

Further, upon reaching various computer system components, program code in the form of computer-executable instructions or data structures can be transferred automatically from transmission media to computer storage devices (or vice versa). For example, computer-executable instructions or data structures received over a network or data link can be buffered in RAM within a NIC (e.g., input/output hardware 105), and then eventually transferred to the system memory 103 and/or to less volatile computer storage devices (e.g., data store 104) at the computer system 101. Thus, it should be understood that computer storage devices can be included in computer system components that also (or even primarily) utilize transmission media.

Computer-executable instructions comprise, for example, instructions and data which, when executed at the processor(s) 102, cause the computer system 101 to perform a certain function or group of functions. Computer-executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, or even source code.

Those skilled in the art will appreciate that the invention may be practiced in network computing environments with many types of computer system configurations, including, personal computers, desktop computers, laptop computers, message processors, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, mobile telephones, PDAs, tablets, pagers, routers, switches, and the like. The invention may also be practiced in distributed system environments where local and remote computer systems, which are linked (either by hardwired data links, wireless data links, or by a combination of hardwired and wireless data links) through a network, both perform tasks. As such, in a distributed system environment, a computer system may include a plurality of constituent computer systems. In a distributed system environment, program modules may be located in both local and remote memory storage devices.

As illustrated, the data store 104 can store computer-executable instructions and/or data structures representing application programs such as, for example, a tracer 104 a, an operating system kernel 104 b, and application 104 c (e.g., the application that is the subject of tracing by the tracer 104 a), and one or more trace file(s) 104 d. When these programs are executing (e.g., using the processor(s) 102), the system memory 103 can store corresponding runtime data, such as runtime data structures, computer-executable instructions, etc. Thus, FIG. 1 illustrates the system memory 103 as including time application code 103 a and application runtime data 103 b (e.g., each corresponding with application 104 c).

The tracer 104 a is usable to trace execution of an application, such as application 104 c, and to store trace data in the trace file 104 d. In some embodiments, the tracer 104 a is a standalone application, while in other embodiments the tracer 104 a is integrated into another software component, such as the operating system kernel 104 b, a hypervisor, etc. While the trace file 104 d is depicted as being stored in the data store 104, the trace file 104 d may also be recorded exclusively or temporarily in the system memory 103, or at some other storage device.

FIG. 1 includes a simplified representation of the internal hardware components of the processor 102. As illustrated, each processor 102 includes a plurality of processing units 102 a. Each processing unit may be physical (i.e., a physical processor core) and/or logical (i.e., a logical core presented by a physical core that supports hyper-threading, in which more than one application thread executes at the physical core). Thus, for example, even though the processor 102 may in some embodiments include only a single physical processing unit (core), it could include two or more processing units 102 a presented by that single physical processing unit.

Each processing unit 102 a executes processor instructions that are defined by applications (e.g., tracer 104 a, operating kernel 104 b, application 104 c, etc.), and which instructions are selected from among a predefined processor instruction set architecture. The particular instruction set architecture of each processor 102 varies based on processor manufacturer and processor model. Common instruction set architectures include the IA-64 and IA-32 architectures from INTEL, INC., the AMD64 architecture from ADVANCED MICRO DEVICES, INC., and various Advanced RISC Machine (“ARM”) architectures from ARM HOLDINGS, PLC, although a great number of other instruction set architectures exist and can be used by the present invention. In general, an “instruction” is the smallest externally-visible (i.e., external to the processor) unit of code that is executable by a processor.

Each processing unit 102 a obtains processor instructions from a shared processor cache 102 b (i.e., shared by the processing units 102 a), and executes the processor instructions based on data in the shared cache 102 a. In general, the shared cache 102 b is a small amount (i.e., small relative to the typical amount of system memory 103) of random-access memory that stores on-processor copies of portions of the system memory 103. For example, when executing the application code 103 a, the shared cache 102 b contains portions of the application runtime data 103 b. If the processing unit(s) 102 a require data not already stored in the shared cache 102 b, then a “cache miss” occurs, and that data is fetched from the system memory 103 (potentially evicting some other data from the shared cache 102 b). Entries (or lines) in the shared processor cache 102 b are mapped to memory addresses in system memory 103 (these could be physical or virtual addresses, depending on processor). As discussed in more detail later, a cache can be a “directly mapped cache” (meaning that each memory address can be cached into only one particular line in the shared processor cache 102 b), or an “associative cache” (meaning that each memory address can be cached into one of a set of lines in the shared processor cache 102 b).

A shared cache 102 b may include a code cache portion and a data cache portion (not depicted). For example, when executing the application code 103 a, the code cache stores at least a portion of the processor instructions stored in the application code 103 a and the data cache stores at least a portion of data structures of the application runtime data 103 b. Often times, a processor cache is divided into separate tiers/layers (e.g., layer 1, layer 2, and layer 3), with some tiers (e.g., layer 3) potentially existing separate from the processor 102. Thus, the shared cache 102 b may comprise one of these layers (layer 1), or may comprise a plurality of these layers.

Each processing unit 102 also includes microcode 102 c, which comprises control logic (i.e., executable instructions) that control operation of the processor 102, and which generally functions as an interpreter between the hardware of the processor and the processor instruction set architecture exposed by the processor 102 to executing applications. The microcode 102 may be embodied on on-processor storage, such as ROM, EEPROM, etc.

FIG. 2 illustrates an example trace file 200 (e.g., corresponding to trace file 104 d of FIG. 1). During execution of an application (e.g., application 104 c), the tracer 104 a can maintain a separate data stream 201 in the trace file 200 for each processing unit 102 a (i.e., for each thread). The example trace file 200 includes four data streams 201 a-201 d (and thus would correspond to four processing units executing four different threads), but the trace file 200 could include any number of data streams 201 depending on a number of processing units 102 a available at the computer system 101 (whether they be in a single processor 102 or multiple processors 102) and/or a number of threads utilized by the application 104 c.

The data steams 201 may be included in a single file, or may each be stored in different files. Each data stream 201 includes data packets 202 storing trace data that is usable to reproduce execution of the corresponding thread. As depicted, individual packets 202 may be of differing sizes, depending on trace file implementation and on the particular information stored. In the depicted example, data stream 201 a for a first processing unit/thread has logged packets 202 a and 202 b, data stream 201 b for a second processing unit/thread has logged packet 202 c, data stream 201 c for a third processing unit/thread has logged packets 202 d-202 g, and data stream 201 d for a fourth processing unit/thread has logged packets 202 h-202 k.

In general, each data stream 201 is recorded independently, such that the timing of the events recorded by data packets in one data stream is generally independent from the timing of the events recorded by data packets in another data stream. However, in some embodiments, the trace file 200 stores sequencing numbers 203 that record the execution sequence of certain “orderable” events across the threads. For example, FIG. 2 also illustrates that packet 202 d of data stream 201 c includes a first sequencing number 203 a, packet 202 b of data stream 201 a includes a second sequencing number 203 b, and packet 202 k of data stream 201 d includes a third sequencing number 203 c. Thus, using the sequencing numbers 203 a-203 c, it is known that an orderable event recorded in packet 202 d on data stream 201 c occurred prior to an orderable event recorded in packet 202 b on data stream 201 a, and that the orderable event recorded in packet 202 b on data stream 201 a occurred prior to an orderable event recorded in packet 202 k on data stream 201 d.

Embodiments may utilize as the sequencing number a monotonically incrementing number (“MIN”), which is guaranteed not to repeat. Orderable events may be defined according to a “trace memory model,” which is used to identify how to store (e.g., in a trace) interactions across threads (e.g., based on how the threads interact through shared memory, their shared use of data in the shared memory, etc.). Depending on implementation, a trace memory model may be weaker or stronger than a memory model used by the processor 102. The trace memory model used may be a memory model defined by a programming language used to compile code (e.g., C++ 14), or some other memory model defined for purposes of tracing.

Some implementations of application tracing observe execution of each thread of an application, and may record, for each thread, one or more of (i) initial state of a thread's execution (e.g., processor registers), (ii) the side effects of certain instructions, such as “non-deterministic” instructions (i.e., those instructions that do not produce fully predictable outputs because their outputs are not fully determined by data in processor general registers or memory) and/or un-cached reads by recording register values and/or memory values that were changed by execution of the instruction, or (iii) the memory values that instructions in the thread consumed. Using this data, and using the actual code of the application being traced, a full reproduction of application execution can be reproduced.

Various embodiments herein improve on these techniques by modifying the behavior of the processor 102's shared processor cache 102 a to facilitate recording cache data that is actually consumed by a processing unit as it executes a thread.

Initially, FIG. 3A illustrates a logical view of a conventional shared cache 300 a. As depicted, the shared cache 300 a includes a plurality of cache lines 303, each of which includes an address portion 301 and a value portion 302. While, for simplicity in illustration, only four cache lines 303 are depicted, one of ordinary skill in the art will recognize that an actual shared processor cache would likely have many more cache lines. For example, a contemporary INTEL processor may contain a layer-1 cache comprising 512 cache lines. In this cache, each cache line is usable to store a 64 byte (512 bit) value in reference to an 8 byte (64 bit) memory address (i.e., a physical or virtual address in the system memory 103).

In general, embodiments presented herein operate to utilize the shared processor cache 102 b, at least in part, to generate trace file(s) 104 d. There are several ways in which this can be done. One straightforward approach is to log all cache misses related to a traced entity to the trace file(s) 104 d. However, this approach has the disadvantage of generating large trace files. This is because the shared processor cache 102 b is used by entities other than the ones being traced, including other applications and the operating system kernel 104 b. Thus, when there are context switches to entities other than the one being traced, these entities can “pollute” the cache by causing cache misses or otherwise writing to the cache. As a result, each time context returns to the entity being traced this approach would need to assume that the cache contains no valid entries for the entity being traced, and continue logging all cache misses for the traced entity—even though these entries may have been previously logged prior to the context switch. For example, this approach may need to invalidate (e.g., flush) and/or log all cache entries that correspond to the entity being traced each time there is a context switch to another entity, since they may be polluted by that other entity during its execution.

Accordingly, embodiments herein include mechanisms for identifying and logging only cache misses relating to the entity being traced, while avoiding re-logging prior logged cache entries after a context switch. In particular, embodiments operate to identify when a cache line has been consumed by an entity (e.g., thread) being traced, so that only these cache lines are logged into the trace file(s) 104 d, and also operate to account for cache pollutions by other entities. Three general embodiments for identifying cache lines that are to be logged are presented herein. The first extends the shared processor cache 102 b by associating one or more “accounting bits” (e.g., unit bits, index bits, and/or reference bits) with each cache line, and uses those bits to identify when a processing unit (and, by extension, an executing thread) has consumed the cache line, and to identify when the cache line has been polluted by another entity. The first embodiment can be used with both directly mapped caches and associative caches. The second works in concert with the first embodiment, but provides an optimization that significantly reduces trace file size when recording two related threads that are executing at the same processing unit into different log buffers. The third utilizes associative caches, coupled with processor cache way-locking features of some processors, to reserve a subset of the cache for exclusive use by the traced entity and then logs cache misses relating to that subset of the cache.

Facilitating Trace Recording Via Use of Processor Cache Accounting Bits

In accordance with the first general embodiment, FIG. 3B illustrates an example shared cache 300 b that extends each cache line 303 with additional “accounting bits” that each correspond to a different processing unit 102 a of the processor 102. For example, each cache line 303 of shared cache 300 b includes accounting bits in the form a “unit bits” portion 304. Thus, in some embodiments, a shared cache that is shared by two processing units 102 b could include two bits in the unit bits portion 304, as represented by the ‘00’ in each cache line. In connection with these unit bits added to each cache line, embodiments extend the processor's hardware-implemented logic and/or the processor's microcode 102 c to utilize these unit bits to track whether or not the current value in the cache line has been logged (i.e., in the trace file 104 d) on behalf of each processing unit or is otherwise known to the processing unit. For example, a unit bit on a cache line may be set (e.g., to a value of one or true) to indicate that the processing unit associated with the unit bit has logged the current value of the cache line in the trace file 200 (or is otherwise aware of the value), and may be cleared (e.g., to a value of zero or false) to indicate that the processing unit associated with the unit bit does not have the current value of the cache line in the trace file 200 (or is otherwise not aware of the value). Of course the opposite may be true, and each unit bit may be set with a value of zero/false and cleared with a value of one/true.

FIG. 5A illustrates a flowchart of an example method 500 a for recording a trace file of program execution using a processor cache that stores unit bits, such as the shared cache 300 b of FIG. 3B. For example, method 500 a may include acts that are performed by the processor 102 as the tracer 104 a traces the application 104 c. The actions made by the processor 102 may be based on hard-coded logic in the processor 102, soft-coded logic in the microcode 102 c, or by another program such as the tracer 104 and/or the operating system kernel 104 b.

The method 500 a begins at act 501, when the processor 102 detects that there is an operation by a processing unit on a shared cache line. For example, suppose that the processor 102's shared cache 102 b is shared by two processing units 102 a (i.e., P0 and P1). Act 501 may be a result of processing unit P0 performing an operation on a cache line identified by a particular address. Operations may include, for example, a read of a value from the cache line that is caused by a program instruction, a speculative or an implicit read by the processing unit (i.e., reads performed by the processing unit as part of anticipating values that may be needed, or as part maintaining some sort of illusion), or a write to the cache line. At block 502, the processor 102 distinguishes between a read operation and a write operation, and takes two branches depending on the operation type.

If the operation is a read operation, then following the ‘read’ path from decision block 502, at decision block 503 the processor 102 determines whether the read was consumed by the processing unit (P0). In some embodiments, a read is consumed by a processing unit if is used by an instruction of the application 104 c that is being traced. Thus, for example, if the read was caused by P0 as part of a speculative or an implicit read, the read would not have been caused by an instruction of the application 104 c, and would thus not have been consumed by P0. Following the ‘no’ path from decision block 503, the method would therefore end at 504 in the case of a speculative or an implicit read.

Alternatively, if the read was caused by an instruction of the application 104 c that is being traced, the read would have been consumed by P0. Following the ‘yes’ path from decision block 503, decision block 505 is encountered, in which it is determined whether the unit bit for the processing unit is set. As discussed above in connection with FIG. 3B, a unit bit is set for a processing unit when the processing unit has logged or is otherwise aware of the current value in the subject cache line. Thus, if the unit bit for P0 is set, then P0 has already logged the value. In this case, following the ‘yes’ path from decision block 505 the method ends at 506. Alternatively, if the unit bit for P0 is clear, then P0 has not logged the value. Thus, following the ‘no’ path from decision block 505, at act 507 a the value is logged in P0's trace (e.g., a data stream corresponding to P0), and at act 507 b P0's unit bit is set to indicate that it has logged the value in the trace. The method then ends at 508. The particular ordering of acts 507 a and 507 b could vary, including the acts being performed in parallel. As such, the depicted ordering is non-limiting.

Returning to decision block 502, if the operation were instead a write operation, then following the ‘write’ path from decision block 502, at act 509 a the processor 102 sets the unit bit for the processing unit performing the write operation, and at act 509 b the processor clears the unit bits for other processing units. Then, at 510 the method ends. For example, the processor 102 would ensure that the unit bit for P1 is cleared, and that the unit bit for P0 is set. Doing so indicates that any value that P1 may have logged or is otherwise aware of for the cache line is no longer valid, since it was potentially changed by P0. The particular ordering of acts 509 a and 509 b could vary, including the acts being performed in parallel. As such, the depicted ordering is non-limiting.

Note that, for simplicity, method 500 a assumes that tracing features of the processor 102 are enabled for each read and write operation. Note that if a read occurs with tracing features disabled, then unit bits for the affected cache line are left un-touched. However, if a write occurs with tracing features disabled, the unit bits for the affected cache line are always set to zero (since any processing unit that had logged the cache line now has invalid data).

Thus, the following tables provide examples of how the unit bit for a particular processing unit might change using method 500 a in connection with read and write operations, and depending on whether or not tracing is enabled at the time of the read/write operation. Note that entries accompanied by an asterisk (*) indicate that the cache line may be logged to the trace in connection with the operation.

Unit Bit, Consumed Memory Reads Tracing On Tracing Off Value was 0 1* 0 Value was 1 1  1

Unit Bit, Memory Writes Tracing On Tracing Off Value was 0 1* 0 Value was 1 1  0

Following is a first concrete example demonstrating general operation of method 500 a in the context of shared cache 300 b. This example assumes a very simple two-line shared cache in which each cache line has bits reserved for a memory address, a value, and accounting bits including unit bits for two processing units (P0 and P1). Also, this example assumes that tracing is turned on for each processing unit involved. In this case, an initial state of the shared cache may be (with the left unit bit corresponding to P0 and the right unit bit corresponding to P1):

Address Value Bits Per Unit <null> <null> 0-0 <null> <null> 0-0

In a first step, suppose P0 were to perform a speculative or an implicit read from address X. Here, a cache miss occurs (since the value was not already in the cache) so the data is imported into the first cache line of the shared cache 300 b from system memory 103. Note that no express entry needs to be made in the trace to document the occurrence of a cache hit, a cache miss, or a cache eviction. In FIG. 5A, following the ‘read’ branch from decision block 502, it would be determined at decision block 503 that the read was not consumed by P0 (i.e., since it was caused by the processor instead of a program instruction). As such, the method ends at 504, without having logged anything to the trace. Following the read, the cache would now contain the value of X that was imported to the cache:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 <null> <null> 0-0

Next, in a second step, suppose P0 were to perform a read from address Y. Another cache miss occurs (since the value was not already in the cache) so the data is imported into the second line of the shared cache 300 b from the system memory 103. In FIG. 5A, following the ‘read’ branch from decision block 502, it would be determined at decision block 503 that the read was consumed by P0. Thus, following the ‘yes’ branch to decision block 505 is it determined whether the unit bit in the cache line storing address Y that corresponds to P0 is set. Here, the bit is not set (it has a zero value), so this is new information for P0. Thus, at act 507 a a packet is added to the trace for P0 that contains at least the first value of Y, and at act 507 b P0's unit bit is set to indicate that it has logged the value in the cache line. At 508 the method ends. Now, the state of the cache is as follows:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <1^(st) value of Y> 1-0

Next, in a third step, suppose P0 were to perform another read from address Y. In FIG. 5A, following the ‘read’ branch from decision block 502, it would be determined at decision block 503 that the read was consumed by P0. Thus, following the ‘yes’ branch to decision block 505 is it determined whether the unit bit in the cache line storing address Y that corresponds to P0 is set. Here, the bit is set (it has a value of one), so this is not new information for P0. Thus, at 506 the method ends. No information has been added to the trace, and the state of the cache has not changed:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <1^(st) value of Y> 1-0

Next, in a fourth step, suppose P1 were to perform a read from address Y. In FIG. 5A, following the ‘read’ branch from decision block 502, it would be determined at decision block 503 that the read was consumed by P1. Thus, following the ‘yes’ branch to decision block 505 is it determined whether the unit bit in the cache line storing address Y that corresponds to P1 is set. Here, the bit is not set (it has a zero value), so this is new information for P1. Thus, at act 507 a a packet is added to the trace for P1 that contains the first value of Y, and at act 507 b P1's unit bit is set. At 508 the method ends, and the state of the cache is as follows:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <1^(st) value of Y> 1-1

Next, in a fifth step, suppose P0 were to perform a write to address Y. In FIG. 5A, following the ‘write’ branch from decision block 502, at acts 509 a/509 b the unit bit for P0 is set (since P0 knows the value that was just written), and the unit bit for P1 is cleared (since its knowledge of the value of Y is no longer up to date). Note that since the unit bit for P0 was already set, the processor 102 may be optimized to refrain from actually setting the bit. Similarly, if the unit bit for P1 were to have already been in a cleared state, the processor 102 may be optimized to refrain from actually clearing the bit. Regardless of how the processor 102 accomplishes acts 509 a/509 b, what matters is that the unit bit for the processing unit doing the write (i.e. P0 in this case) is set, and the unit bits for all other processing units (i.e., P1 in this case) are cleared. Note that the trace for P0 need not be updated with the new value of Y, since P0 performed the write and it already has knowledge of the value written. At 510 the method ends, and the state of the cache is as follows:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <2^(nd) value of Y> 1-0

Next, in a sixth step, suppose P0 were to perform another write to address Y. In FIG. 5A, following the ‘write’ branch from decision block 502, at acts 509 a/509 b the unit bit for P0 is set, and the unit bits for all other processing units are cleared. In this case, these bits actually need not change, since they are already in the proper state. Again, the trace for P0 need not be updated with the new value of Y, since P0 performed the write and it already has knowledge of the value written. At 510 the method ends, and the state of the cache is as follows:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <3^(rd) value of Y> 1-0

For simplicity in illustration, there may be some considerations not expressly depicted in FIG. 5A, the behavior of which may vary based on implementation. For example, a write, by a processing unit, to data that is does not already have cached.

To illustrate, suppose that in a seventh step P1 were to perform a write to address Y. Here, since the unit bit for P1 is in a cleared state P1 does not already have knowledge of the value at address Y. This can be handled in a couple of ways, (i) performing the write without first bringing in the value, or (ii) doing a cache miss to bring the value at the address into the cache, and then performing the write (i.e., a read followed by a write).

In the first case, the processor 102 could perform the write and mark the unit bits for the other processing units as not current (i.e., act 509 b), with nothing being added to the trace. In this instance, however, the processor 102 does not mark the cache value as known to P1 (e.g., act 509 a is skipped). This would result in an end state of the cache as follows:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <4^(th) value of Y> 0-0

In the second case, the processor 102, could first perform a read, by following the ‘read’ path from decision block 502, following the ‘yes’ path from decision block 503, taking the ‘no’ path from decision block 505, logging the third value of Y to P1's trace and setting P1's unit bit at 507 a/507 b, and ending at 508. The intermediary state of the cache would then be as follows:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <3^(rd) value of Y> 1-1

Then, the processor 102, could perform the write, by following the ‘write’ path from decision block 502, performing acts 509 a/509 b, and ending at 510. Thus, the end state of the cache would be:

Address Value Bits Per Unit X <1^(st) value of X> 0-0 Y <4^(th) value of Y> 0-1

Rather than adding accounting bits (unit bits, in this case) to each cache line, some embodiments instead reserve entire cache lines for the accounting bits. Doing so may simplify designing the processor 102 to facilitate recording a trace file, since the physical layout of the shared cache 102 b may be left unchanged, and the use of accounting bits may be enabled by modifications to the microcode 102 c.

FIG. 4A illustrates an example of a shared cache 400 a that reserves one or more cache lines for storing accounting bits (e.g., unit bits) that apply to other cache lines. Similar to FIGS. 3A and 3B, the shared cache 400 a of FIG. 4A includes a plurality of cache lines 403, each of which has an address portion 401 and a value portion 402. However, the shared cache 400 a includes one or more reserved cache line(s) 403 a that are used for storing accounting bits (unit bits). The bits of the reserved cache line are allocated into different groups of unit bits that each corresponds to a different cache line, and in which each unit bit in a group correspond to a different processing unit 102 b. For example, the shared cache 400 a depicts four groups of unit bits stored in the reserved cache line, with each unit bit in the group corresponding to a different processing unit of two available processing units (the “+” marks are merely included to visually separate the groups in the drawing). If there were more than two processing units, then each group would have an additional unit bit for each additional processing unit. Notably, using a reserved cache line to store metadata for many cache lines is usable beyond shared caches and could be extended, for example, to private caches.

As depicted, the reserved cache line 403 a may in some embodiments use all bits of the cache line for accounting bits, without regard for standard address vs. value bit divisions of the cache line. In some embodiments, however, the accounting bits are stored only in the value portion of the cache line. In such cases, the address portion may be used to identify the reserved cache line, to signal the cache line as being reserved, or for some other purpose.

To illustrate, if the example INTEL cache discussed above (having 512 cache lines each having a 64 bit value portion and a 512 bit value portion) were to be shared by two processing units, two of those cache lines could be reserved for accounting bits (unit bits, in this case). Thus, 510 cache lines would remain available as regular cache lines for caching data. In some implementations, a first cache line of the reserved cache lines may then store unit bits for a first half (i.e., 255) of the remaining cache lines, and a second cache line of the reserved cache lines may then store unit bits for a second half (i.e., 255) of the remaining cache lines. Thus, 510 bits of the 512 bits of the value portion of each cache line could be used for unit bits (i.e., two unit bits each corresponding to one of the two processing units, multiplied by 255 cache lines), with the remaining two bits being left unused or used for some other purpose. Of course, the address portion could be used for accounting bits and/or for some other purpose.

In context of the shared cache 400 a of FIG. 4A, operation of the method 500 a of FIG. 5A would be analogous to how it was described in connection with the shared cache 300 b and the first concrete example, except that the unit bits in the reserved cache lines 403 a are used instead of unit bits added to each cache line. For example, the first set of two unit bits in the reserved cache line would be used similarly to the unit bits for the first cache line and in connection with P0 and P1, the second set of two unit bits in the reserved cache line would be used similarly to the unit bits for the second cache line and in connection with P0 and P1, and so forth.

In some embodiments, rather than having accounting bits comprising “unit bits” that each corresponds to a different processing unit, the accounting bits may instead operate as “index bits” that specify an index to a processing unit 102 a (e.g., a processing unit at index value 1, a processing unit at index value 2, a processing unit at index value 3, etc.). In other words, embodiments may implement shared caches that include a processor index per cache line, instead of one bit per processor for each cache line. This can be done using index bits added per cache line (e.g., analogous to FIG. 3B), or using index bits stored in reserved cache lines (e.g., analogous to FIG. 4A).

Use index bits is useful, for example, in computer systems 101 in which there are a relatively large number of processing units 102(a) (e.g., tens, hundreds, or even thousands). To illustrate, suppose that computer system 101 includes one or more processor(s) 102 comprising 64 hyper-threading capable processing units 102 a (cores), such that the processor(s) 102 presents 128 logical processing units 102 a (capable of concurrently supporting 128 different application threads). Using the example shared caches of FIGS. 3B and 4A—which use accounting bits comprising unit bits—this would mean adding 128 accounting bits (sixteen bytes) for each cache line. Those of skill in the art will recognize that this may be a significant (and potentially unrealistic) amount of memory to add to a shared cache. If, however, the accounting bits instead operate as “index bits,” each the 128 processing units 102 a can be identified by an index value (e.g., 0-127) using only seven accounting bits per cache line instead of 128 accounting bits per cache line.

In some embodiments, one index value is reserved (e.g., “invalid”) to indicate that no processor has logged a cache line. Thus, in the foregoing example, this would mean that the seven accounting bits would actually be able to represent 127 processing units 102 a, plus the reserved value. For example, binary values 0000000-1111110 might correspond to index locations 0-126 (decimal), and binary value 1111111 (e.g., −1 or 127 decimal, depending on interpretation) might correspond to “invalid,” to indicate that no processor has logged the corresponding cache line, though this notation could vary, depending on implementation. For example, some implementations could use the value of 128 (decimal) as the reserved value, though this would mean using eight index bits per cache line, rather than seven. It will be appreciated by one of ordinary skill in the art that the number of index bits per cache line can vary, depending on the number of processing units being supported, such that there are sufficient bits to represent an index to each processing unit being traced.

While reducing overhead in the shared cache, use of “index bits” versus “unit bits” does come with the drawback that tracking shared reads on cache lines is less accurate, which translates to larger trace files. However, for systems with a great number of processing units, larger trace file size may be a desirable tradeoff compared against the overhead of using a separate “unit bit” for each of those processing units and for each cache line.

FIG. 5B illustrates a flowchart of an example method 500 b for recording a trace file of program execution using a processor cache that stores index bits as accounting bits. For example, method 500 b may include acts that are performed by the processor 102 as tracer 104 a traces application 104 c. The actions made by the processor 102 may be based on hard-coded logic in the processor 102, soft-coded logic in the microcode 102 c, or by another program such as the tracer 104 and/or the operating system kernel 104 b. Note the particular arrangement of the elements of FIG. 5B are one example only, and one of ordinary skill in the art that the exact arrangement/logical flow of elements could vary in various ways to arrive at the same or similar results.

Method 500 b begins at act 511, when the processor 102 detects that there is an operation by a particular processing unit 102 a on a shared cache line. For example, suppose that the processor 102's shared cache 102 b is shared by a number of processing units 102 a, including a processing unit P0 (i.e., index zero). Act 511 may be a result of processing unit P0 performing an operation on a cache line identified by a particular address. Operations may include, for example, a read of a value from the cache line that is caused by a program instruction, a speculative or an implicit read by the processing unit (i.e., reads performed by the processing unit as part of anticipating values that may be needed, or as part maintaining some sort of illusion), or a write to the cache line. At block 512, the processor 102 distinguishes between a read operation and a write operation, and takes one of two branches depending on the operation type.

If the operation is a read operation, then following the ‘read’ path from decision block 512, at decision block 513 the processor 102 determines whether hardware-assisted tracing is enabled for P0. Of not, then following the ‘no’ path from decision block 513, the method ends at 514. Otherwise, if tracing is enabled, then following the ‘yes’ path from decision block 513, at decision block 515 the processor 102 determines whether the read was consumed by the processing unit (P0). As described earlier, a processing unit consumes a read if that read is used by an instruction of the application 104 c that is being traced. Thus, for example, if the read was caused by P0 as part of a speculative or an implicit read, the read would not have been caused by an instruction of the application 104 c, and would thus not have been consumed by P0. Following the ‘no’ path from decision block 513, the method would therefore end at 516 in the case of a speculative or an implicit read.

Alternatively, if the read was caused by an instruction of the application 104 c that is being traced, the read would have been consumed by P0. Thus, following the ‘yes’ path from decision block 515, decision block 517 is encountered—in which it is determined whether the index bits for the cache line are set to P0's index (e.g., zero). Index bits for a cache line are set to the index of a processing unit when the processing unit has logged or is otherwise aware of the current value in the cache line. Thus, if the index bits for the cache line reflect the index of P0, then P0 has already logged the value. In this case, following the ‘yes’ path from decision block 517 the method ends at 518. Alternatively, if the index bits for the cache line reflect something other than the index of P0 (e.g., some other processor index, or the “invalid” reserved value), then P0 has not logged the value. Thus, following the ‘no’ path from decision block 517, at act 519 a the value is logged in P0's trace (e.g., a data stream corresponding to P0), and at act 519 b the index bits for the cache line are set to the index of P0, indicating that P0 has logged the value in the trace. The method then ends at 520. The particular ordering of acts 519 a and 519 b could vary, including the acts being performed in parallel. As such, the depicted ordering of these acts is non-limiting.

Returning to decision block 512, if the operation were instead a write operation, then following the ‘write’ path from decision block 512, decision block 521 is encountered, in which it is determined whether hardware-assisted tracing is enabled for P0. Of not, then following the ‘no’ path from decision block 521, at act 522 the cache line's index bits are set to the “invalid” reserved value (e.g., −1) and then the method ends at 523. By setting the index bits to the “invalid” reserved value, any processing unit that had logged the value of the cache line that existed prior to the write operation is informed that the logged value is no longer valid.

Otherwise, if tracing is enabled, then following the ‘yes’ path from decision block 521, at decision block 524 the processor 102 determines whether the index bits for the cache line are set to P0's index (e.g., zero), similar to decision block 517. From this point, the method 500 b proceeds much like it did from decision block 517. In particular, if the index bits already reflect P0, then following the ‘yes’ path from decision block 524 the method ends at 525. Alternatively, if the index bits for the cache line reflect something other than the index of P0 (e.g., some other processor index, or the “invalid” reserved value), then P0 needs to signal that is has knowledge of the value written. Thus, following the ‘no’ path from decision block 524, at act 526 a the value might be logged in P0's trace (e.g., a data stream corresponding to P0), and at act 526 b the index bits for the cache line may be set to the index of P0, indicating that P0 has knowledge of the value. The method then ends at 527.

Note that acts 526 a and 526 b are shown with broken lines, to indicate that not all implementations may perform the acts. In particular, since P0 is performing the write, P0 implicitly has knowledge of the value written. As such, it may not be necessary to log the value written to the trace. Additionally, if the cache line was not logged (i.e., act 526 a is skipped) but the write is for the full cache line width, some embodiments may nonetheless set the index bits for the cache line of the index of P0 (i.e., perform act 526 b). Furthermore, if the cache line was not logged (i.e., act 526 a is skipped) but the write is for less than the entire cache line width, some embodiments may set the index bits to the reserved “invalid” value. Note that, although not depicted in FIG. 5A, analogous actions may be performed during writes if the unit bit is not already set for the processing unit.

The following tables provide examples of how the index bits for a cache line might change using method 500 b in connection with read and write operations, and depending on whether or not tracing is enabled at the time of the read/write operation. Note that the value of −1 represents the “invalid” reserved value. Additionally, entries accompanied by an asterisk (*) indicate that the cache line might need to be logged to the trace in connection with the operation.

Index Bits, Consumed Memory Reads Tracing On Tracing Off Index was −1 2* −1 Index was 7 2* 7 Index was 2 2  2

Index Bits, Memory Writes Tracing On Tracing Off Index was −1 2* −1 Index was 7 2* −1 Index was 2 2  −1

Following is a second concrete example demonstrating general operation of method 500 a in the context of shared cache 300 b, in which shared cache 300 b uses index bits instead of unit bits. The second concrete example uses a two-line shared cache, and which generally mirrors the first concrete example—this time using index bits instead of unit bits. Note that for simplicity this example shows only two processing units, but as discussed previously the use of index bits (rather than unit bits) enable processor-assisted tracing to scale to a great number of processing units. This is demonstrated by using processing units P0 and P126 (i.e., indexes 0 and 126). Again, this example assumes that tracing is turned on for each processing unit involved. In this case, an initial state of the shared cache may be:

Address Value Index <null> <null> 1111111 (−1) <null> <null> 1111111 (−1)

Note that in this initial state the accounting bits for each cache line are set to the “invalid” value (−1, in this implementation). This may be because the processor has been operating up to this point with tracing disabled (such that act 522 of method 500 b has been performed during writes), and/or because the accounting bits are initialized to the “invalid” value at system initialization.

In a first step, suppose P0 were to perform a speculative or an implicit read from address X. Here, a cache miss occurs (since the value was not already in the cache) so the data is imported into the first cache line from system memory 103. Note that no express entry needs to be made in the trace to document the occurrence of a cache hit, a cache miss, or a cache eviction. In FIG. 5B, following the ‘read’ branch from decision block 512, it would be determined at decision block 513 that tracing is enabled, and then at decision block 515 that the read was not consumed by P0 (i.e., since it was caused by the processor instead of a program instruction). As such, the method ends at 516, without having logged anything to the trace and without having changed the accounting bits. Following the read, the cache would now contain the value of X that was imported to the cache:

Address Value Index X <1^(st) value of X> 1111111 (−1) <null> <null> 1111111 (−1)

Next, in a second step, suppose P0 were to perform a read from address Y. Another cache miss occurs (since the value was not already in the cache) so the data is imported into the second cache line from the system memory 103. In FIG. 5B, following the ‘read’ branch from decision block 512, it would be determined at decision block 513 that tracing is enabled, and then at decision block 517 that the read was consumed by P0. Thus, following the ‘yes’ branch to decision block 517 is it determined whether the index bits for the cache line storing address Y are set to the index of P0 (i.e., 0000000). Here, they are set to −1 (i.e. 1111111), so this is new information for P0. Thus, at act 519 a a packet is added to the trace for P0 that contains at least the first value of Y, and at act 519 b the index bits are set to P0's index to indicate that it has logged the value in the cache line. At 520 the method ends. Now, the state of the cache is as follows:

Address Value Index X <1^(st) value of X> 1111111 (−1) Y <1^(st) value of Y> 0000000 (0) 

Next, in a third step, suppose P0 were to perform another read from address Y. In FIG. 5B, following the ‘read’ branch from decision block 512 and the ‘yes’ branch from decision block 513, it would be determined at decision block 515 that the read was consumed by P0. Thus, following the ‘yes’ branch to decision block 517 is it determined whether the index bits for the cache line storing address Y are set to the index of P0 (i.e., 0000000). Here, they are set to P0's index, so this is not new information for P0. Thus, at 518 the method ends. No information has been added to the trace, and the state of the cache has not changed:

Address Value Index X <1^(st) value of X> 1111111 (−1) Y <1^(st) value of Y> 0000000 (0) 

Now, in a fourth step, suppose P126 were to perform a read from address Y. In FIG. 5B, following the ‘read’ branch from decision block 512 and the ‘yes’ branch at decision block 513, it would be determined at decision block 515 that the read was consumed by P126. Thus, following the ‘yes’ branch to decision block 517 is it determined whether the index bits for the cache line storing address Y are set to the index of P126 (i.e., 1111110). Here, they are set to P0's index (i.e. 000000), so this is new information for P126. Thus, at act 519 a a packet is added to the trace for P126 that contains at least the first value of Y, and at act 519 b the index bits are set to P126's index to indicate that it has logged the value in the cache line. At 520 the method ends. Now, the state of the cache is as follows:

Address Value Index X <1^(st) value of X> 1111111 (−1)  Y <1^(st) value of Y> 1111110 (126)

Next, in a fifth step, suppose P0 were to perform a write to address Y. In FIG. 5B, following the ‘write’ branch from decision block 502 and the ‘yes’ branch from decision block 521, at decision block 524 is it determined whether the index bits for the cache line storing address Y are set to the index of P0 (i.e., 0000000). Here, they are set to index 126 (i.e. 1111110), so this is new information for P0. Thus, at act 526 a a packet might be added to the trace for P0 that contains at least the first value of Y, and at act 526 b the index bits are set to P0's index to indicate that it has logged the value in the cache line. At 527 the method ends. Now, the state of the cache is as follows:

Address Value Index X <1^(st) value of X> 1111111 (−1) Y <2^(nd) value of Y> 0000000 (0) 

Note that if tracing had instead been disabled (i.e., the ‘no’ branch from decision block 521), then the index bits for the cache line storing address Y would have instead been set to the reserved “invalid” value (e.g., −1).

Next, in a sixth step, suppose P0 were to perform another write to address Y. In FIG. 5B, following the ‘write’ branch from decision block 512 and the ‘yes’ branch from decision block 521, at decision block 524 is it determined whether the index bits for the cache line storing address Y are set to the index of P0 (i.e., 0000000). Here, they are set to P0's index, so this is not new information for P0. Thus, at 525 the method ends. No information has been added to the trace, and the state of the cache is as follows:

Address Value Index X <1^(st) value of X> 1111111 (−1) Y <3^(rd) value of Y> 0000000 (0) 

Significant trace file size optimizations can be further achieved using additional “reference value” accounting bits in the shared cache 102 c. These reference value bits can be employed whether using accounting bits in the form of unit bits, or using accounting bits in the form of index bits. For example, FIG. 3C illustrates an example shared cache 300 c that includes, for each cache line, additional accounting bits in the form of a “reference bits” portion 305. The bits in the reference bits portion are used to store a reference to a location in a processing unit's trace, for when that processing unit recorded a cache line value in its trace. Then, when that same cache line is later consumed by another processing unit, and the cache line contains the same address and value, the other processing unit can record only the reference value stored in the reference bits, instead of the cache line's value. Since storing reference values can occupy a fraction of the bits that storing the cache values may occupy, substantial trace file size savings can result. As an example, in the second step of the first and second concrete examples above a packet containing the value of Y was added to P0's trace. Later, in the fourth step, the same value was added to P1/P126's trace. Using reference values, storing the full value could have been avoided in favor of storing a reference value.

To illustrate possible space savings, suppose that, as part of recording a cache line's value in the trace file 200, the tracer 104 a adds a packet to a processing unit's data stream that includes both the memory address and the value. In the case of the example INTEL cache used above (in which each cache line has an 8 byte value portion and a 64 byte value portion), recording the address and the value would occupy 72 bytes on the trace file. Now, suppose that an implementation utilizing this cache stored a reference value (i.e., in the reference value portion 305) as an 8 byte sequencing number (e.g., as discussed in connection with FIG. 2), plus an 8 byte count (e.g., an instruction count counting the number of instructions executed by the processor since the sequencing number was added to the trace). Such a reference would occupy only 16 bytes. Thus, use of a reference number (instead of recording the full memory address/value) would enable a debugger replaying the trace file 200 to uniquely identify in the trace when a given processor recorded the address and value, based on a 16 byte trace entry as opposed to a 72 byte trace entry.

The forgoing provides a nearly 5:1 space savings for a trace entry versus storing the full address and value each time a value is consumed. Other possible reference notations could include a processor identification followed by some count that could identify when in that processor's trace the reference value was stored. Those of ordinary skill in the art will recognize that there are a multitude of different reference notations that could be used. In FIG. 3C the reference values are symbolically illustrated as “0:0000” referring to a processor identifier and a count, separated by a colon (“:”).

Just as, in FIG. 4A, a shared cache 400 a may store accounting bits (e.g., unit bits or index bits) using reserved cache lines instead of adding bits to each cache line (as in the shared cache 300 b of FIG. 3B), some embodiments may store reference bits in reserved cache lines. For example, FIG. 4B illustrates an embodiment of a shared cache 400 b that stores both unit accounting bits and reference value accounting bits in reserved cache lines 403 b. In the reserved cache lines 403 b of the shared cache 400 b, each of the two reserved cache lines stores accounting bits for two different cache lines, using two pluralities of accounting bits, each including unit bits or accounting bits for P0 and P1 (00), followed by reference bits (0:0000, such that each plurality is symbolically notated as 00-0:0000).

FIG. 6 illustrates a flowchart of an example method 600 for recording a trace file of program execution using a processor cache storing reference bits, such as the shared cache 300 c of FIG. 3C or the shared cache 400 b of FIG. 4B. Many of the initial elements (e.g., 601, 602, 603, 604, 605, and 613) of FIG. 6 operate similar to corresponding elements (e.g., 501, 502, 503, 604, 505, and 506) of FIG. 5A. As such, the discussion in connection with FIG. 5A applies to these elements and are not described in detail here.

Similar to the discussion of FIG. 5A, suppose that the processor 102's shared cache 102 b is shared by two processing units 102 a (i.e., P0 and P1). Now, suppose that a processing unit (e.g., P0) has performed a read that is consumed by the processing unit, and that the unit bit for the processing unit is not set. Flow would proceed through elements 601, 602, 603, and 605 to arrive at new decision block 606. Here, it is determined if the value being read has already been logged by another processing unit. This can be determined by observing the values of the unit bits for the cache line being read—if the unit bit for any other processing unit (e.g., P1) is set, then that processing unit has logged the value. If not, then following the ‘no’ path, the processor logs the cache line and sets the processing unit's (e.g., P0's) unit bit in acts 607 a and 607 b (which are analogous to acts 507 a and 507 b of FIG. 5A) and updates the reference value for the cache line at act 607 c. In particular, the processing unit may store in the reference bits any reference notation that enables the value that was just logged in act 507 a to be found later by a debugger for use in connection with another processing unit. Then, at 608, the method ends. The particular ordering of acts 607 a-607 c could vary, including the acts being performed in parallel. As such, the depicted ordering is non-limiting.

Returning to decision block 606, if the value had been logged by another processing unit (e.g., P1), then following the ‘yes’ path to acts 609 a and 609 b, the reference value stored in the cache for the cache line is logged in the trace for the processing unit currently doing the read (instead of the value of the cache line), and the unit bit is set for the processing unit (e.g., P0). This reference value would have been written by another processing unit (e.g., P1) when it previously consumed the value of the cache line, and logged that value in the trace in connection with acts 607 a-607 b. The method then ends at 610. The particular ordering of acts 609 a and 609 b could vary, including the acts being performed in parallel. As such, the depicted ordering is non-limiting.

Now, suppose instead that a processing unit (e.g., P0) had performed a write operation. Flow would proceed through elements 601 and 602 to arrive at acts 611 a-611 c. Acts 611 a and 611 b are analogous to acts 509 a and 509 b (the unit bits of other processing units are cleared, and the unit bit for this processing unit is set), but at new act 611 c, the reference value for the cache line is updated. In particular, since the processing unit that just performed the write has knowledge of the value written, this processing unit's trace could be replayed to this point to obtain the value later. As such, this value can be referenced by another processing unit using the reference value just written. At 612 the method ends. The particular ordering of acts 611 a-611 c could vary, including the acts being performed in parallel. As such, the depicted ordering is non-limiting.

Although not depicted, there could potentially be some additional steps that may also update a reference value. For example, a reference value may optionally be updated when the unit bit is set for a processing unit (i.e., following the ‘yes’ path from decision block 605, and prior to ending at 613), and/or when the value is logged by another processing unit (i.e., following the ‘yes’ path from decision block 606, and prior to ending at 610). Doing serves the purpose of keeping fresher reference values. In some embodiments, depending on how reference values are stored, this may help handle ‘wrap around’ in which the reference value grows to exceed a number of bits allocated to store the reference value.

Following is a third concrete example demonstrating general operation of method 600 in the context of shared cache 400 b. This example assumes a very simple three-line shared cache in which two cache lines are used for caching system memory, and one cache line is reserved for accounting bits (both unit bits and reference bits). In this case, an initial state of the shared cache may be:

Address Value <null> <null> <null> <null> 00-<null> + 00-<null>

In this example, the reference value for a processing unit is simply notated as the processing unit's number and a count, separated by a colon (e.g., “0:0000”). In the table above, the reference values are initially set to ‘null’. Using this simple notation, the value for a processing unit is incremented by one each time it is updated (e.g., 0:0001 for first reference value for P0, 0:0002 for second reference value for P0, 1:0001 for first reference value for P1, 1:0002 for second reference value for P1, and so forth). Note, however, that most implementations would use a reference value that can be reliably incremented in such a way that, at replay, a debugger can track the increment value for a given thread without tracking other threads. For example, the count could be based on activities like entries logged in the trace file for that thread, the number of activities that potentially could have been logged to the file, etc.

As in the first example, suppose that in a first step P0 were to perform a speculative or an implicit read from address X. Here, a cache miss occurs (since the value was not already in the cache) so the data is imported into the first line of the shared cache 300 b from system memory 103. Again, no express log entry needs to be made to document the occurrence of a cache hit, a cache miss, or a cache eviction. In FIG. 6, following the ‘read’ branch from decision block 602, it would be determined at decision block 603 that the read was not consumed by P0 (i.e., since it was caused by the processor instead of a program instruction). As such, the method ends at 604, without having logged anything to the trace. Following the read, the cache would now contain the value of X:

Address Value X <1^(st) value of X> <null> <null> 00-<null> + 00-<null>

Next, in a second step, suppose P0 were to perform a read from address Y. Another cache miss occurs (since the value was not already in the cache) so the data is imported into the second line of the shared cache 400 b from the system memory 103. In FIG. 6, following the ‘read’ branch from decision block 602, it would be determined at decision block 603 that the read was consumed by P0. Thus, following the ‘yes’ branch to decision block 605 is it determined whether the unit bit in the cache line storing address Y that corresponds to P0 is set. Here, the bit is not set (it has a zero value), so this is new information for P0. Thus, following the ‘no’ path to decision block 606, it is determined whether the value is logged by another processing unit. Since P1's unit bit for the cache line is cleared, flow takes the ‘no’ path to acts 607 a and 607 b, where a packet is added to the trace for P0 that contains at least the first value of Y and P0's unit bit is set to indicate that it has logged the value in the cache line (i.e., the unit bits now “10”). Additionally, at act 607 c the reference value for the cache line is updated. Here, it is represented as “0:0001,” indicating that P0 has the value at a count of 0001 (whatever that count may be, depending on implementation, so long as it can be used later to locate the value using P0's trace). At 608 the method ends. Now, the state of the cache is as follows:

Address Value X <1^(st) value of X> Y <1^(st) value of Y> 00-<null> + 10-0:0001

Next, in a third step, suppose P1 were to perform a read from address Y. In FIG. 6, following the ‘read’ branch from decision block 602, it would be determined at 603 that the read was consumed by P1. Thus, following the ‘yes’ branch to decision block 605 is it determined whether the unit bit in the cache line storing address Y that corresponds to P1 is set. Here, the bit is not set (it has a zero value), so this is new information for P1. At decision block 606 it is determined whether the value is logged by another processing unit (i.e., P0). Here, it would be determined that the value is logged, since P0's unit bit is set for the cache line. Thus, following the ‘yes’ branch to acts 609 a and 609 b, the reference value (i.e., 0:0001) is stored in P1's trace, and P1's unit bit is set to note that it has logged (i.e., has a reference to, in this case) the value. At 610 the method ends, and the state of the cache is as follows:

Address Value X <1^(st) value of X> Y <1^(st) value of Y> 00-<null> + 11-0:0001

Note that, as illustrated above, storing the reference value can occupy orders of magnitude fewer bits on P1's trace than storing the value. In the example give above, for instance, the reference value may occupy 16 bytes versus occupying 72 bytes for storing a memory address and value. One of ordinary skill in the art will recognize, in view of the disclosure herein, that could be various different ways to store reference values that occupy various numbers of bits (in some cases far fewer than 16 bytes), so the space savings can vary based on implementation.

Now, in a fourth step, suppose that P1 were to perform a write to address Y. In FIG. 6, following the ‘write’ branch from decision block 602, at acts 611 a/611 b the unit bit for P1 is set (since it knows the value that was just written), and the unit bit for P0 is cleared (since its knowledge of the value of Y is no longer up to date). Note that since the unit bit for P1 was already set, the processor 102 may be optimized to refrain from actually setting the bit. Similarly, if the unit bit for P0 were to have already been in a cleared state, the processor 102 may be optimized to refrain from actually clearing the bit. Regardless of how the processor 102 accomplishes acts 611 a/611 b, what matters is that the unit bit for the processing unit doing the write (i.e. P1) is set, and the unit bits for all other processing units are cleared. Note that the trace for P1 need not be updated with the new value of Y, since P1 performed the write and it already has knowledge of the value written. Additionally, at act 611 c the reference value for the cache line is updated such that the value could be obtained later by replaying P1's trace. At 612 the method ends, and the state of the cache is as follows:

Address Value X <1^(st) value of X> Y <2^(nd) value of Y> 00-<null> + 01-1:0001

Next, in a fifth step, suppose P1 were to perform another write to address Y. In FIG. 6, following the ‘write’ branch from decision block 602, at acts 611 a/611 b the unit bit for P1 is set, and the unit bits for all other processing units are cleared. In this case, these bits actually need not change, since they are already in the proper state. Again, the trace for P1 need not be updated with the new value of Y, since P1 performed the write and it already has knowledge of the value written. Additionally, at act 611 c the reference value for the cache line is updated such that the value could be obtained later by replaying P1's trace. At 612 the method ends, and the state of the cache is as follows:

Address Value X <1^(st) value of X> Y <3^(rd) value of Y> 00-<null> + 01-1:0002

Finally, in a sixth step, suppose P0 were to perform another read from address Y. In FIG. 6, following the ‘read’ branch from decision block 602, it would be determined at decision block 603 that the read was consumed by P0. Thus, following the ‘yes’ branch to decision block 605 is it determined whether the unit bit in the cache line storing address Y that corresponds to P0 is set. Here, the bit is not set (it has a zero value), so this is new information for P0. Thus, following the ‘no’ path to decision block 606, it is determined whether the value is logged by another processing unit. Since P1's unit bit for the cache line is set, flow takes the ‘yes’ path to acts 609 a and 609 b where the reference value (i.e., 01:0002, referencing the 3^(rd) value of Y on P1's trace) is stored in P0's trace, and P0's unit bit is set to note that it has logged (i.e., has a reference to, in this case) the value. At 610 the method ends, and the state of the cache is as follows:

Address Value X <1^(st) value of X> Y <3^(rd) value of Y> 00-<null> + 11-1:0002

FIGS. 4A and 4B illustrate just two of many different manners in which reserved cache lines are usable to store accounting bits. FIGS. 4C and 4D, for example, illustrate some additional ways to use reserved cache lines to track whether or not a processing unit has logged a cache line as well as reference values. Each of these examples are presented in the context of a simple shared cache that includes four active cache lines and different numbers of reserved cache lines, and in which the shared cache is shared by two processing units.

FIG. 4C illustrates an example shared cache 400 c that is similar to the shared cache 400 b of FIG. 4B, in which accounting bits for two or more cache lines are stored in each reserved cache line, except that one set of reference bits in shared cache 400 c are used in connection with multiple sets of unit bits/index bits. Thus, a single set of reference bits is used in connection with storing reference values for multiple cache lines. This enables, for example, fewer reserved cache lines to be used to record a trace file of program execution using a processor cache storing reference bits. In FIG. 4C, for example, the shared cache 400 c includes two reserved cache lines 403 c, each of which stores accounting bits for two of the regular cache lines. The accounting bits in each of these cache lines are represented as “00+00” for two sets of unit bits/index bits (one for each cache line) along with “0:0000” for a reference value to be used in connection with those two sets of unit bits/index bits.

In this shared cache, when an existing reference value is updated by a processing unit, that existing reference value is added to the processing unit's trace so that it can be found later. For example, assume a simple cache, shared by two processing units, having with two regular cache lines and one reserved cache line, as follows:

Address Value X <1^(st) value of X> Y <1^(st) value of Y> 00 + 00 - <null>

Now, if P0 reads from address Y, this is new information for P0. The first value of Y is logged in P0's trace, the unit bit for cache line Y and P0 is set, and the reference value is updated (in reference to P0 and a count) as follows:

Address Value X <1^(st) value of X> Y <1^(st) value of Y> 00 + 10 - 0:0001

Next, if P1 reads from address Y, this is new information for P1. Since P0 has already logged the value of Y, the reference to the value of Y in P0's trace (i.e., 0:0001) is logged in P1's trace, the unit bit for cache line Y and P1 is set, and the reference value remains unchanged, as follows:

Address Value X <1^(st) value of X> Y <1^(st) value of Y> 00 + 11 - 0:0001

Now, suppose P1 reads from address X. This is new information for P1, so the value should be logged on P1's trace. Normally, the reference value would also be updated, so that the value of X on P1's trace could be referenced later. However, now cache lines X and Y share the same reference value bits in the reserved cache line. Thus, P0's reference to the first value of Y would be lost if these bits were simply overwritten. Instead, the processor adds to P1's trace both (i) the 1^(st) value of X (as it normally would), as well as (ii) the current reference value in the reserved cache line (i.e., 0:0001, which references the first value of Y on P0's trace). The processor then updates the reference value in reference to P1 (in reference to P1 and a count). The state of the cache may then be:

Address Value X <1^(st) value of X> Y <1^(st) value of Y> 00 + 11 - 1:0002

If the reference to Y on P0's trace (0:0001) is needed later, it could be found by following reference value 1:0002 to P1's trace. Thus, reference values form chains through different processing unit's traces, which can be traversed later to obtain all needed values. Note that, as an optimization, if the back reference being recorded for a processing unit refers to that processing unit's own trace, that back reference can be omitted on the trace in some embodiments. However, due to ordering considerations across traces, cross-processor entries can typically not be omitted.

Note that the techniques described above are described the context of tracking the logging of traces at a processor-level granularity. However, they can also be applied to tracking the logging at a cache-level granularity. For example, a level-3 (“L3”) cache can track which level-2 (“L2”) cache(s) have logged information, instead of which processors have logged the information. L2 caches, in turn, might track which level-1 (“L1”) cache logged the information. Note that these approaches may use referencing techniques, similar to those described in connection with concrete example 3 and FIG. 6, that include pointing to data logged by other processors to allow for shared tracking of logging by all the processors of a given cache.

FIG. 4D illustrates another example shared cache 400 d which uses a reserved cache line to store unit bits and, for each reserved cache line that stores unit bits, uses a separate cache line for each processor to store reference values for that processor. For example, in the shared cache 400 d of FIG. 4D, there are four reserved cache lines 403 d. Of these cache lines, one cache line (cache line 404) is used to store unit bits for each regular cache line, and two cache lines (cache lines 405) are used to store reference values for each of two processing units. In this shared cache 400 d, each of cache lines 405 may store a count that is updated (e.g., incremented) each time its corresponding processing unit performs a read that is consumed by the processing unit, and also each time the processing unit performs a write that can be used to identify the value read or written by replaying the processing unit's trace. These reference values can then be used by in another processing unit's trace to reference those values.

FIG. 4E illustrates a hybrid shared cache 400 e that adds additional accounting bits to each cache line, and that also uses reserved cache lines for accounting bits. For example, the hybrid shared cache 400 e includes unit bits 406 that behave similar to the unit bits 304 of shared cache 300 b, as well as reserved cache lines 403 e that behave similar to the cache lines 405 of the shared cache 400 d that are used to store reference values for each of two processing units.

Each of the foregoing cache embodiments may have their own benefits and drawbacks. For example, different cache types may be chosen to achieve differing processor design goals (e.g., microcode complexity vs. die space devoted to memory). In another example, different cache types may be chosen to balance the amount of reserved cache lines needed vs. complexity in replaying a trace later. In another example, different cache types may be chosen to balance the amount of reserved cache lines needed vs. trace file size or complexity. In another example, different cache types may be chosen to balance the amount of reserved cache lines needed vs. the rate in which thread concurrency issue arise. As one of ordinary skill in the art will recognize, there may be many more considerations for choosing a particular cache embodiment.

While the foregoing “accounting bit” embodiments have been described in the context of a shared processor cache that is shared between two or more processing units, many of the embodiments herein are applicable to private caches as well. For example, additional accounting bits in a private cache can assist with creating a trace for a thread, even though that private cache is used by a single processing unit. In some embodiments, for instance, each cache line of a private cache is associated with one or more additional bits (e.g., on the same cache line similar to FIG. 3A, or on a different reserved cache line similar to FIG. 4A) that are used to signify when a cache line has been modified by some entity other than the thread that is being traced. These accounting bits are then useful in circumstances when the processing unit is not entirely devoted to executing the thread.

To illustrate, a processing unit may not be entirely devoted to executing a thread being traced due to a context switch between user mode and kernel mode. Thus, for example, if a user mode thread is being traced, the cache lines it uses may be modified as a result of a context switch to kernel mode—during which time a kernel mode thread may write to those cache lines. Thus, one or more accounting bits could be used to signal when a cache line was modified during a kernel mode switch. In this example, when the thread being traced consumes a cache line, that thread may set an accounting bit associated with the cache line. Then, when some other entity (e.g., a kernel mode thread) writes to the cache line the processor may clear that bit.

Some additional embodiments include use of “dirty bits” to further reduce trace file size. For example, as part of recording a trace of a thread, it may be useful to record a copy of the entire memory contents of the thread. Often times, recording memory contents of a thread comprises recording only runtime memory of the thread (and not recording both memory containing executable code of the thread). For example, since most code does not change during execution of a thread, a trace file space savings can be achieved by omitting it from the trace. However, some programs dynamically modify their code at runtime. In order to efficiently capture these changes, some embodiments include use of a “dirty bit” on a page table.

In these embodiments, when code is read into a memory page, a bit (e.g., in a page table) associated with memory page is used to signal that page as being “clean.” Then, if any portion of that memory page is written to at runtime, the bit is toggled to indicate the memory page is now “dirty.” This “dirty” bit is then used during execution of the thread to reduce trace file size. In particular, if a portion of the memory page is brought into a cache line when the memory page is indicated as being clean, then that read into the cache is omitted from the trace file (since the value read can be obtained from the code of the program). Conversely, if a portion of the memory page is brought into a cache line when the memory page is indicated as being dirty, then that read into the cache is recorded to the trace file.

The foregoing can be extended to memory pages that store runtime data as opposed to code. For example, when a memory page is recorded to a trace file, the dirty bit associated with the memory page can be cleared to indicate that the memory page is clean. Then, subsequent reads from that memory page to the processor cache can be omitted from the trace file so long as the page remains marked “clean.” However, whenever the memory page is written to, the dirty bit can be set, and subsequent reads from that memory to the processor cache can be logged to the trace.

In view of the foregoing, one or more embodiments include a computing device for facilitating recording a trace of program execution using a processor cache, and which uses accounting bits in the form of unit bits. For example, the computing device may comprise the computer system 101 and/or the processor(s) 102 of FIG. 1. The computing device comprises a plurality of processing units, such as processing units 102 a, and a processor cache 102 b which is shared by the plurality of processing units, and which is configured to cache data from a memory device, such as the system memory 103.

The processor cache includes a plurality of cache lines that each comprises at least (i) an address portion for storing a memory address of the memory device, and (ii) a value portion for storing a value associated with the memory address. For example, each processor cache of FIGS. 3A-4E includes an address portion and a value portion. The processor cache also includes a set of accounting bits, that include different pluralities of accounting bits. Each plurality of accounting bits is associated with a different cache line, and includes a different unit bit associated with a different one of the plurality of processing units. For example, the caches of FIGS. 3B-4E each include different example arrangements of accounting bits, including unit bits for each cache line that indicate whether a corresponding processor has logged or otherwise has knowledge of the value in the cache line. In some of these arrangements (e.g., FIGS. 3B, 3C, and 4E), each cache line also comprises its corresponding plurality of accounting bits. In other arrangements (e.g., FIGS. 4A-4D), the set of accounting bits is stored in one or more reserved cache lines of the processor cache.

The computing device includes stored control logic (e.g., computer-executable instructions stored in the data store and/or as part of microcode 104) that is configured to use the pluralities of accounting bits to indicate, for each cache line and for each processing unit, whether or not a trace file logs for the processing unit a current value stored in the value portion of the cache line. For example, FIGS. 5 and 6 illustrate flowcharts for recording a trace file of program execution using a processor cache, including use of unit bits.

In some embodiments, in connection with a read operation, the control logic may be configured to determine that a particular unit bit associated with a particular processing unit and a particular cache line has not been set (e.g., decision block 505 of FIG. 5A or 606 of FIG. 6). Then, based on the particular unit bit not being set, the processor 102 may log at least a value stored in the value portion of the particular cache line into the trace file on behalf of the particular processing unit (e.g., act 507 a or 607 a), and set the particular unit bit (e.g., act 507 b or 607 b). In some embodiments, a unit bit is cleared based on detecting of a write operation by a processing unit on a cache line. For example, the control logic may clear each unit bit in the plurality of accounting bits associated with a cache line being written to, except for the unit bit associated with the processing unit doing the writing (e.g., acts 509 a and 509 b or 611 a and 611 b).

In some embodiments, the plurality of accounting bits for at least one cache line also include reference bits for storing a reference value (e.g., FIGS. 3C and 4B-4E). In these embodiments, the stored control logic is configured to store some values on the trace file by reference. For example, FIG. 6 illustrates a flowchart for recording a trace file of program execution using a processor cache, including use of unit bits and reference bits.

In some embodiments that include reference bits, and in connection with a read operation, the control logic may determine that a particular unit bit associated with a particular processing unit and a particular cache line has not been set (e.g. decision block 605 of FIG. 6), and determine that a value stored in a value portion of the particular cache line has not already been logged by another processing unit (e.g., decision block 606). Then, based on the particular unit bit not being set, and based on the value having not already been logged by another processing unit, the processor 102 may log the value into the trace file (e.g., act 607 a), set the particular unit bit (e.g., act 607 b), and update the reference value for the particular cache line (e.g., act 607 c). Later, when another processing unit reads the value from the particular cache line, the control logic may determine that the value stored in the value portion of the particular cache line has already been logged by another processing unit (e.g., decision block 606). Then, based on the particular unit bit not being set, and based on the value having already been logged by another processing unit, the processor 102 may log the reference value into the trace file (e.g., act 609 a) and set the particular unit bit (e.g., act 609 b). In some embodiments, a reference value is also updated based on detecting of a write operation by a processing unit on a cache line (e.g., act 611 c).

In connection with the preceding computing device, or more embodiments include a method for facilitating recording a trace file of program execution using a processor cache, and which uses accounting bits in the form of unit bits. The method is described in connection with the flowchart of FIG. 5A. The method is implemented at a computing device (e.g., computer system 101 and/or processor(s) 102) that includes a plurality of processing units (e.g., processing units 102 a) and the processor cache (e.g., shared cache 102 b), which is shared by the plurality of processing units. The processor cache includes a plurality of cache lines that are each associated with a different plurality of accounting bits, each plurality of accounting bits including a different unit bit that is associated with a different one of the plurality of processing units (e.g., see the shared caches of FIGS. 3B-4E).

The method includes identifying an operation by a particular processing unit of the plurality of processing units on a particular cache line of the plurality of cache lines (e.g., act 501 in FIG. 5A or act 601 in FIG. 6). Based at least on identifying the operation, the method may include, when the operation comprises a read operation that is consumed by the particular processing unit (e.g., ‘read’ from decision block 502 or 602 and ‘yes’ from decision block 503 or 603), and when a particular unit bit for the particular processing unit in the plurality of accounting bits associated with the particular cache line is not set (e.g., ‘no’ from decision block 505 or 605), (i) causing at least the value portion of the particular cache line to be stored or referenced in the trace file (e.g., act 507 a or act 607 a), and (ii) setting the particular unit bit (e.g., act 507 b or act 607 b). Based at least on identifying the operation, the method may include, when the operation comprises a write operation (e.g., ‘write’ from decision block 502 or 602), clearing each unit bit in the plurality of accounting bits associated with the cache line that are associated with any processing unit other than the particular processing unit, and setting the particular unit bit associated with the particular processing unit (e.g., acts 509 a and 509 b or 611 a and 611 b).

In some embodiments, the method is implemented at a computing device in which the processor cache also includes at least one set of reference bits that store a reference value for the particular cache line (e.g., FIGS. 3C and 4B-4E). In these embodiments, when the plurality of accounting bits associated with the particular cache line indicate that no other processing unit has logged the value stored in the value portion of the particular cache line (e.g., ‘no’ from decision block 606), causing at least the value portion of the particular cache line to be stored or referenced in the trace file may include causing the value portion of the particular cache line to be stored in the trace file by causing the value to be stored in the trace file (e.g., act 607 a). Additionally, in these embodiments, when the plurality of accounting bits associated with the particular cache line indicate that another processing unit has logged the value stored in the value portion of the particular cache line (e.g., ‘yes’ in decision block 606), causing the value portion of the particular cache line to be stored or referenced in the trace file may include causing the value portion of the particular cache line to be referenced in the trace file by causing the reference value to be stored in the trace file (e.g., act 609 a). In these embodiments, the reference value for a cache line may be updated when a processing unit writes to the cache line (e.g., act 611 c).

In addition to the foregoing, one or more embodiments also include a computing device for facilitating recording a trace of program execution using a processor cache, and which uses accounting bits in the form of index bits. For example, the computing device may comprise the computer system 101 and/or the processor(s) 102 of FIG. 1. The computing device comprises a plurality of processing units, such as processing units 102 a, and a processor cache 102 b which is shared by the plurality of processing units, and which is configured to cache data from a memory device, such as the system memory 103.

The processor cache includes a plurality of cache lines that each comprises at least (i) an address portion for storing a memory address of the memory device, and (ii) a value portion for storing a value associated with the memory address. For example, each processor cache of FIGS. 3A-4E includes an address portion and a value portion. The processor cache also includes different pluralities of accounting bits. Each plurality of accounting bits is associated with a different cache line of the plurality of cache lines. For example, the caches of FIGS. 3B-4E each include different example arrangements of accounting bits, which, as discussed in connection with FIG. 5B, and can index bits associated with for each cache line to specify an index to a processing unit that has logged or otherwise has knowledge of the value in the cache line.

The computing device includes stored control logic (e.g., computer-executable instructions stored in the data store and/or as part of microcode 104) that is configured to use the different pluralities of accounting bits to indicate, for each cache line, an index to one of the plurality of processing units for which a trace file logs a current value stored in the value portion of the cache line, or an indicator that the trace file does not log the value portion of the cache line for any processing unit. For example, FIG. 5B illustrates a flowchart for recording a trace file of program execution using a processor cache, including use of index bits. As discussed, unlike unit bits, index bits can readily support computing devices that have a large number of processing units.

In some embodiments, the stored control logic indicates whether or not a trace stream for a particular processing unit logs at least the current value stored in the value portion of a particular cache line. This can be done by setting the accounting bits associated with the particular cache line to an index of the particular processing unit, to indicate that the trace stream for the particular processing unit does log at least the current value stored in the value portion of the particular cache line. For example, the accounting bits may be set in act 519 b of FIG. 5B during a read operation, or in act 526 b during a write operation.

With respect to occurrence of a consumed read operations, in some embodiments the stored control logic determines that the accounting bits associated with the particular cache line are set to a value other than an index of the particular processing unit (e.g., decision block 517 of FIG. 5B), and then, based on the accounting bits being set to a value other than an index of the particular processing unit, the stored control logic logs at least a value stored in the value portion of the particular cache line into the trace file on behalf of the particular processing unit (e.g., act 519 a of FIG. 5B), and sets the accounting bits associated with the particular cache line to the index of the particular processing unit (e.g., act 519 b of FIG. 5B).

With respect to occurrence of write operations, in some embodiments the stored control logic either sets the accounting bits associated with the particular cache line to a reserved value (e.g., −1) based at least determining that tracing is disabled (e.g., act 522 of FIG. 5B), or sets the accounting bits associated with the particular cache line to the index of the particular processing unit based at least on determining that the accounting bits associated with the particular cache line are set to a value other than an index of the particular processing unit (e.g., act 526 b of FIG. 5B).

In connection with the preceding computing device, one or more embodiments also include a method for facilitating recording a trace file of program execution using a processor cache, and which uses accounting bits in the form of index bits. The method is described in connection with the flowchart of FIG. 5B. The method is implemented at a computing device (e.g., computer system 101 and/or processor(s) 102) that includes a plurality of processing units (e.g., processing units 102 a) and the processor cache (e.g., shared cache 102 b), which is shared by the plurality of processing units. The processor cache includes a plurality of cache lines that are each associated with a different plurality of accounting bits (e.g., see the shared caches of FIGS. 3B-4E, in the context of the flowchart of FIG. 5B).

The method includes identifying an operation by a particular processing unit of the plurality of processing units on a particular cache line of the plurality of cache lines (e.g., act 511 in FIG. 5B). Based at least on identifying the operation, setting the plurality of accounting bits for the particular cache line. Per the flow chart of FIG. 5B, the plurality of accounting bits can be set to different values in different situations. For example, the method may include setting the plurality of accounting bits to a reserved value, based at least on (i) the operation comprising a write operation, and (ii) tracing being disabled (e.g., act 522 of FIG. 5B). Alternatively, the method may include setting the plurality of accounting bits to an index of the particular processing unit, based at least on (i) the operation being a write operation, and (ii) the plurality of accounting bits for the particular cache line being set to a value other than the index of the particular processing unit (e.g., act 526 b of FIG. 5B). Alternatively, the method may includes setting the plurality of accounting bits to the index of the particular processing unit, based at least on (i) the operation being a read operation that is consumed by the particular processing unit, and (ii) the plurality of accounting bits for the particular cache line being set to a value other than the index of the particular processing unit (e.g., act 519 b of FIG. 5B).

Reuse of a Related Thread's Cache During Tracing

As mentioned previously, the first general “accounting bit” embodiments operate to avoid needing to invalidate (flush) the cache when the thread being traced resumes from a context switch (e.g., from kernel mode or another thread executing at the same processing unit), since the accounting bits make it known which cache lines may have been polluted by another entity during the context switch. In particular, the “accounting bits” track which processing unit (if any) has logged (or otherwise has knowledge of) the contents of each cache line. Since the accounting bits operate at the granularity of processing units, they are most helpful in the context of (i) tracing a single application thread at any given processing unit (while refraining from tracing any other threads executing at the processing unit, such as kernel mode or other application threads), or (ii) tracing multiple threads at a single processing unit to a single log buffer (which may be useful, for example, for tracing kernel mode threads).

In some embodiments, however, it may be desirable to trace multiple threads that are executing at the same processing unit to separate log buffers (e.g., separate trace data streams or separate trace files). This can present a challenge using the foregoing “accounting bit” embodiments, since these bits capture consumption of a cache line by a processing unit, generally, rather than which particular thread among multiple threads executing at the processing unit consumed the cache line. Without being able to clearly distinguish which thread of multiple threads at a processing unit consumed a cache line, there can be challenges to tracing these multiple threads to different log buffers. For example, if there is a context switch from a first traced thread to a second traced thread at the same processing unit, the second thread's cache may need to be invalidated, since the first thread could have polluted its cache.

Accordingly, when multiple threads executing at the same processing unit are being traced to separate buffers, it is important to ensure that the accounting bits are updated during context switches from one thread to the other. One approach is to “invalidate” the logging state of the entire cache on transitions from one thread to another thread at the same processing unit (i.e., clear the unit bits for all the lines in the cache, or set the index bits for all the lines in the cache to the “invalid” reserved value), which guarantees that there is no cache pollution when switching from one thread to the other at the same processing unit. While this behavior enables multiple threads at a single processing unit to be traced to different buffers, it likely has the effect of needlessly increasing log file size, since logging state of the cache may be “invalidated” in situations when the data in the cache could actually by usable by the thread that is being transitioned to. Thus, since all cache lines were marked as “invalid,” the transitioned-to thread may needlessly log “cache misses” to its log buffer for data that was actually already in the cache. For example, in many instances, different application threads executing at the same processing unit may be related—such as being part of the same application process. As such, the cached data for one thread may actually have a substantial amount of overlap with the cached data of a related thread.

The second general embodiment herein therefore operates to reuse a related thread's cache during tracing. In particular, when there are related threads executing at the same processing unit, embodiments operate at record time to insert information into each of the thread's log buffers that enables the buffers to be cross-referenced at replay time. In some embodiments, this includes recording a unique identifier into a first thread's buffer just prior to a context switch to a second, related, thread, and then recording this same (or related) unique identifier into the second thread's buffer. Then, at replay time, these unique identifiers can be used, when replaying the second thread, to reference cache values logged on the first thread's buffer. Accordingly, when there are context switches between related threads being recorded to the same buffer, invalidating the logging state of the cache on the transition can be avoided. In some testing environments, this has shown to provide significant trace file size reductions (e.g., on the order of 25%-40%) when tracing related threads into different buffers.

FIGS. 10A-10C illustrate some example scenarios to help facilitate an understanding of the foregoing. Initially, FIG. 10A illustrates a timeline diagram corresponding to an embodiment of tracing a single thread (among multiple threads executing at a processing unit) into a single buffer. For example, FIG. 10A shows an execution timeline of a thread 1001 a, whose execution is being traced into buffer 1004 a, and a thread 1002 a that is not being traced (e.g., a kernel mode thread, or some other application thread that is not being traced). During initial execution of thread 1001 a, reads are logged and accounting bits are managed in the manners described in connection with FIGS. 5A, 5B, and 6 (depending on the particular configuration of accounting bits). In buffer 1004 a, data packets are symbolically represented as being separated by vertical lines. At time T1, a context occurs, with execution switching to thread 1002 a. As such, FIG. 10A shows a gap in the traced thread's buffer 1004 a. During this time, if thread 1002 a performs writes, all unit bits for the corresponding cache line are cleared, or index bits for the corresponding cache line are set to invalid (e.g., per FIG. 5B). Then, at time T2, another context switch occurs, and execution of thread 1001 a resumes, with its execution being logged again in buffer 1004 a. Again, reads are logged and accounting bits are managed in the manners described in connection with FIGS. 5A, 5B, and 6.

FIG. 10B illustrates a timeline diagram corresponding to an embodiment of tracing two related threads executing at a single processing unit into different buffers. For example, FIG. 10B shows an execution timeline of related threads 1001 b and 1003 b, whose executions are being traced into buffers 1004 b and 1005 b, and a thread 1002 b that is not being traced (e.g., a kernel mode thread, or some other application thread that is not being traced). During initial execution of thread 1001 b, reads are logged and accounting bits are managed in the manners described in connection with FIGS. 5A, 5B, and 6 (depending on the particular configuration of accounting bits). At time T1, a context occurs, with execution switching to thread 1002 b. As such, FIG. 10B shows a gap in the thread 1001 b's buffer 1004 b. During this time, if thread 1002 b performs writes, all unit bits for the corresponding cache line are cleared, or index bits for the corresponding cache line are set to a reserved value such as −1 (e.g., per FIG. 5B). Then, at time T2, another context switch occurs, and execution of related thread 1003 b starts, with its execution being logged again in buffer 1005 b. Here, even though threads 1001 b and 1003 b are related, thread 1003 b executed between them and could have polluted the cache. As such, any cache continuity between the threads may have been broken, and the logging state of the entire cache is therefore invalidated at the transition.

FIG. 10C illustrates another timeline diagram corresponding to tracing two related threads executing at a single processing unit into different buffers. In particular, FIG. 10C shows an execution timeline of related threads 1001 c and 1003 c, whose executions are being traced into buffers 1004 c and 1005 c. During initial execution of thread 1001 c, reads are logged and accounting bits are managed in the manners described in connection with FIGS. 5A, 5B, and 6 (depending on the particular configuration of accounting bits). At time T1, execution is to switch to related thread 1003 c. Here, since threads 1001 c and 1003 c are related and there will be cache continuity between them, thread 1003 c should be able to use thread 1001 c's buffer 1004 c during replay. As such, prior to the context switch, an identifier 1006 a is recorded to thread 1001 c's buffer 1004 c. After the context switch, an identifier 1006 b is also recorded to thread 1003 c's buffer 1005 c, providing a link between the buffers. Since this connection has been made, there is no need to invalidate the logging state of the entire cache at the transition. Then, during execution of thread 1003 c, reads are logged and accounting bits are managed in the manner described in connection with FIGS. 5A, 5B, and 6.

Later, when replaying thread 1003 c, its buffer 1005 c can be parsed until identifier 1006 b is encountered. Based on this identifier 1006 b a link to buffer 1004 c can be identified, including identifying the location of identifier 1006 a in buffer 1004 c. As such, buffer 1004 c can be parsed starting at the location of identifier 1006 a in order to utilized thread 1001 c's cache while replaying thread 1003 c.

The identifiers 1006 a/1006 b can be any form of identifier that can link the buffers of related threads, and identify unique locations within those buffers. In some embodiments identifiers 1006 a/1006 b are the same identifier, or are related identifiers. Generally, 1006 a/1006 b should be unique within a given set trace buffers.

In accordance with the foregoing, FIG. 11 illustrates a flowchart of an example method 1100 for reusing a related thread's cache during tracing. Method 1100 is described in light of FIGS. 1-10C and their description.

As illustrated, method 1100 includes an act 1101 of executing a first thread while recording to a first buffer. In some embodiments, act 1101 comprises executing a first thread at a particular processing unit of the one or more processing units while recording a trace of execution of the first thread to a first buffer. For example, a first thread of a process from application 104 c may be executing at one of processing unit(s) 102 a. During this time, the tracer 104 a and/or the microcode 102 c causes a trace of the thread's execution to be recorded to a first buffer, such as a first data stream of trace file(s) 104 d. The tracing may be hardware-assisted by the processor(s) 102, including, for example, use of accounting bits on the shared cache 102 b and control logic in microcode 102 c for using those accounting bits (e.g., in accordance with one of FIG. 5A, 5B, or 6). In reference to FIG. 10C, the first thread could be thread 1001 c and the first buffer could be buffer 1004 c.

Method 1100 also includes an act 1102 of detecting a context switch to a second thread. In some embodiments, act 1102 comprises detecting a context switch from the first thread to a second thread executing at the particular processing unit. For example, in reference to FIG. 10C at time T1 a context switch to thread 1003 c occurs.

Method 1100 also includes an act 1103 of determining that the second thread is related and being recorded to a second buffer. In some embodiments, act 1103 comprises, based at least on detecting the context switch, determining that the second thread is related to the first thread and that it is being traced to a second buffer that is separate from the first buffer. For example, the tracer 104 a and/or the microcode 102 c can determine that the second thread (e.g., thread 1003 c) is another thread of the same process of application 104 c, and is therefore related to the first thread. Additionally, the tracer 104 a and/or the microcode 102 c can determine that the second thread 1003 c is being recorded to buffer 1005 c, which a separate buffer from the first thread's buffer 1004 c (e.g., a separate data stream of trace file(s) 104 d).

Method 1100 also includes an act 1104 of reusing the first cache's thread. In some embodiments, act 1104 comprises, based at least on the second thread being related to the first thread and being traced to the second buffer, reusing a cache of the first thread. Act 1104 also includes an act 1105 of recording an identifier in the first buffer, and an act 1106 of recording an identifier in the second buffer. In some embodiments, act 1105 comprises recording a first identifier in the first buffer, and act 1106 comprises recording a second identifier in the second buffer, the first and second identifiers providing a linkage between the first buffer and the second buffer. For example, as shown in FIG. 10C, the tracer 104 a and/or the microcode 102 c can record an identifier 1006 a in thread 1001 c's buffer 1004 c, and record an identifier 1006 b in thread 1003 c's buffer 1005 c. These identifiers are usable, at replay time, for thread 1003 c to use thread 1001 c's cache values that are stored on buffer 1004 c.

Act 1104 also includes an act 1107 of executing the second thread while recording to the second buffer. In some embodiments, act 1107 comprises initiating execution of the second thread at the particular processing unit while recording a trace of execution of the second thread to the second buffer and without invalidating a logging state of the processor cache. For example, FIG. 10C shows that after the context switch at T1, the execution of thread 1003 c is recorded to buffer 1005 c. Note that, since the first and second identifiers were recorded in the first and second thread's buffers, and since the threads are related, logging state of the cache 102 b need not be invalidated during the transition of initiating execution of the second thread, even though the first thread also executes at the processing unit.

In some embodiments, when the second thread (1003 c) performs a write, the microcode 102 c sets a unit bit in the shared cache 102 b, the unit bit corresponding to the particular processing unit and a cache line affected by the write (e.g., as per FIG. 5A), or sets one or more index bits in the shared cache to an index of the particular processing unit, the one or more index bits corresponding to the cache lines (e.g., as per FIG. 5B). As such, the logging state of cache 102 b is not invalidated during execution of the second thread, even though the first thread also executes at the processing unit.

Accordingly, the second general embodiment works in concert with the first general embodiment (use of accounting bits) to reduce trace file size when there are two (or more) related threads that are being traced at the same processing unit, and when those threads are being traced to separate buffers.

Facilitating Trace Recording Via Use of Processor Cache Way-Locking

As mentioned above, there are three general embodiments for identifying when a cache line has been consumed by an entity (e.g., thread) being traced. The first general embodiment, described above, associates one or more “accounting bits” with each cache line, and uses those accounting bits to identify when a processing unit (and, by extension, an executing thread) has consumed the cache line. The second general embodiment works in concert with the first embodiment, but can add identifies to two thread's buffers to avoid invalidating logging state of a cache during a context switch between two related threads executing and being traced at the same processing unit. The third general embodiment utilizes associative caches, coupled with processor cache way-locking features of some processors to reserve a subset of the cache for the entity being traced, and then logs cache misses relating to that subset of the cache.

As a preliminary matter, it will be appreciated that a processor cache is generally much smaller than system memory (often by orders of magnitude), and thus there are usually far more memory locations in the system memory than there are lines in the cache. As such, each processor defines a mechanism for mapping multiple memory locations of system memory to particular line(s) in a cache. As mentioned briefly above, processors generally employ one of two general techniques: direct mapping and associative (or set-associative) mapping.

FIG. 7A illustrates an example 700 of direct mapping. In example 700, different memory locations 703 in system memory 701 are mapped to just one line 704 in a cache 702, such that each memory location can only be cached into only one line in the cache 702. Thus, in the example, memory locations 703 a and 703 e (memory indexes 0 and 4) are mapped to cache line 704 a (cache index 0), memory locations 703 b and 703 f (memory indexes 1 and 5) are mapped to cache line 704 b (cache index 1), and so on.

With set-associative mapping, on the other hand, different locations in system memory can be cached to one of multiple lines in the cache. FIG. 7B illustrates an example 700′ of set-associative mapping. Here, cache lines 704′ of cache 702′ are logically partitioned into different sets of two lines each, including a first set of two lines 704 a′ and 704 b′ (identified as index 0), and a second set of two lines 704 c′ and 704 d′ (identified as index 1). Each line in a set is identified as a different “way,” such that line 704 a′ is identified by index 0, way 0, 704b′ is identified by index 0, way 1, and so on. As further depicted, memory locations 703 a′, 703 c′, 703 e′, and 703 g′ (memory indexes 0, 2, 4, and 6) are mapped to index 0. As such, each of these locations in system memory can be cached to any cache line within the set at index 0 (i.e., lines 704 a′ and 704 b′). The particular patterns of the depicted mappings are for illustrative and conceptual purposes only, and should not be interpreted as the only way in which memory indexes can be mapped to cache lines.

Set-associative caches are generally referred to as being N-way set-associated caches, where N is the number of “ways” in each set. Thus, the cache 702′ of FIG. 7B would be referred to as a 2-way set-associative cache. Processors commonly implement N-way caches where N is a power of two (e.g., 2, 4, 8, etc.), with N values of 4 and 8 being commonly chosen (though the embodiments herein are not limited to any particular N-values or subsets of N-values). Notably, a 1-way set-associative cache is generally equivalent to a direct-mapped cache as shown in FIG. 7B, since each set contains only one cache line. Additionally, if N equals the number of lines in the cache, it is referred to as a fully associative cache, since it comprises a single set containing all lines in the cache. In fully associative caches any memory location can be cached to any line in the cache.

It is noted that FIGS. 7A and 7B represent a simplified view of system memory and caches, in order to illustrate general principles. For example, while FIGS. 7A and 7B map individual memory locations to cache lines, it will be appreciated that each line in a cache generally stores data relating to multiple addressable locations in system memory. Thus, in FIGS. 7A and 7B each location (703 a-703 h and 703 a′-703 h′) in system memory (701, 701′) may actually represent a plurality of addressable memory locations. Additionally, as alluded to previously, mappings may be between actual physical addresses in system memory 701/701′ and lines in the cache 702/702′, or may use an intermediary layer of virtual addresses.

Embodiments herein utilize set-associative caches by implementing “way-locking,” which locks or reserves certain ways in a cache for some purpose. In particular, the embodiments herein utilize way-locking to reserve one or more ways for the entity that is being traced, such that the locked/reserved ways are used exclusively for storing cache misses relating to execution of the entity that is being traced. Thus, referring back to FIG. 7, if “way 0” were locked for the traced entity, then cache lines 704 a′ and 704 c′ (i.e., index 0, way 0 and index 1, way 0) would be used exclusively for cache misses relating to execution of the trace entity, and the remaining cache lines would be used for all other cache misses. FIG. 8 illustrates an expanded example 800 that includes a 4-way set-associative cache 802 (showing two sets 803 a and 803 b, also identified as I0 and I0), and in which ways 0 and 1 (identified as W0 and W1) in each set are reserved/locked (as indicated by the asterisks) for handling cache misses only for the traced entity. The remaining ways (e.g., ways 2 and 3) are available generally for handling cache misses for all other entities. This division is for illustrative purposes only, and any division could be used (e.g., two reserved and 6 available generally, six reserved and two available generally, etc.).

FIG. 8 also illustrates a partial mapping of memory addresses in system memory 801 to lines of the cache 802. FIG. 8 utilizes a similar simplified view of system memory and caches was used above in connection with FIGS. 7A and 7B. FIG. 8 represents memory locations corresponding to three entities, including memory locations 804 a and 804 a′ corresponding to memory space of the entity that is being traced, and memory locations 804 b and 804 c corresponding to memory space of two other entities. In FIG. 8, the memory locations 804 a and 804 a′ corresponding to the entity that is being traced are mapped to the locked ways (i.e., ways 0 and 1), and memory locations corresponding to the other entities are mapped to the other general use ways (i.e., ways 2 and 3). Again, this mapping is for illustrative and conceptual purposes only, and it merely indicates that different memory address of the traced entity's memory space are mapped to the locked/reserved ways, and that memory addresses used by entities other than that traced entity are mapped to other non-reserved general-purpose ways, without being limited to any particular mapping pattern.

In some embodiments, the memory addresses corresponding to the memory space of the entity that is being traced are identified in reference to a particular memory address in system memory 801 corresponding to the root of a page table data structure for the traced entity (which contains mappings between physical memory addresses virtual memory addresses seen by the traced entity). Thus, this particular memory address, and the page table(s) it identifies, are used by the processor to determine whether a given cache miss should be stored in the reserved/locked ways, or stored in the general-purpose ways.

In some embodiments, at least a portion of the memory address pointing to the traced entity's page table is stored in a processor register, such as a context register, which is then referred to when a cache miss occurs in order to determine whether or not the cache miss applies to the traced entity's memory space. It will be appreciated by one of ordinary skill in the art that, in many architectures, page tables are stored at physical memory page boundaries. Thus, a context register may need only store the “high” bits of the memory address.

While locking ways for exclusive use by a particular entity can increase the predictability and performance of execution of that entity, it can also be applied to efficient tracing of execution of the traced entity, as well as reduced trace file sizes as compared to other techniques. In particular, it is noted that since the locked/reserved way(s) are used exclusively for the traced entity, a full record of memory accesses by the traced entity can be obtained by recording in the trace file the memory values cached into the reserved way(s). Since memory values relating to cache misses by any entity other than the traced entity cannot generally be cached in the locked/reserved way(s), other entities cannot interfere with (pollute) the data in the cached way(s), with the possible exception of the operating system kernel 104 b, as discussed below. Accordingly, through use of way-locking, there may be no need to track whether a memory access by another entity has invalidated the traced entity's knowledge of a cache line (e.g., by using accounting bits, as described above).

As mentioned briefly above, in some environments the operating system kernel 104 b may potentially pollute locked/reserved ways, and this needs to be handled. Handling kernel pollution of locked ways can involve (i) tracking when the kernel 104 b uses locked ways, or (ii) preventing the kernel 104 b from using the locked ways altogether.

An embodiment for tracking when the kernel 104 b has used a locked way involves use a context register identifying the root of the page table of the entity being traced (to identify that the cache miss relates to execution of the traced entity), together with identifying the ring mode of the processor 102 at the time of the cache miss (i.e., whether the processor 102 is executing under user mode or kernel mode at the time of the cache miss). In this embodiment, cache misses are logged to the trace file(s) 104 d when the context register identifies the root of the page table of the entity being traced, and when the processor 102 is executing in user mode. On the other hand, cache misses are not logged (or are logged but may be flagged as being cache misses caused by the kernel 104 b) when the context register identifies the root of the page table of the entity being traced, and when the processor 102 is executing in kernel mode.

As mentioned above, other embodiments prevent the kernel 104 b from using locked ways altogether. In one embodiment, the processor 102 uses the context register identifying the root of the page table of the entity being traced, together with the ring mode of the processor 102 at the time of the cache miss, to send cache misses relating to the kernel 104 b to the general-purpose ways instead of the locked ways. For example, any cache misses that occurs when the context register identifies the traced entity, but the ring mode is kernel mode, are sent to the non-locked ways.

Another embodiment leverages page table groups (e.g., multilevel page tables), and involves switching the value of the context register when transitioning between user mode and kernel mode. In particular, when switching from user mode to kernel mode while executing a traced entity, the kernel 104 b can switch the value of the context register from a value corresponding to the root of the traced entity's page table, to a value pointing to another page table in the same page table group as the traced entity's page table. In this way, the value of the context register is different when executing in kernel mode than when executing the traced entity in user mode, and the kernel mode cache misses are therefore stored in the general-purpose ways instead of the locked ways.

FIG. 9 illustrates a flowchart of a method 900 for facilitating recording a trace of code execution using a set-associative processor cache. FIG. 9 is described in connection with the computer architecture 100 of FIG. 1 and the example 800 of FIG. 8. In general, the method 900 of FIG. 9 is performed in a computing environment that comprises one or more processing units that are associated with at least one set-associative processor cache that includes a plurality of sets of cache lines, and in which each set comprises two or more different cache lines. For example, method 900 may be performed at computer system 101, in which the shared cache 102 b is an N-way set-associative cache where N is two or greater, that caches data from system memory 103. The method 900 may be performed based on computer-executable instructions stored in the data store 104 (e.g., tracer 104 a) and/or in microcode 102 c.

As depicted, method 900 includes an act 901 of reserving cache line(s) in set(s) of a set-associative cache. Act 901 can comprise reserving/locking one or more cache lines in one or more of the plurality of sets of cache lines for caching only locations in a system memory that are allocated to a particular executable entity. For example, the tracer 104 may request (e.g., via operating system kernel 104 b) that the processor(s) 102 reserve/lock one or more ways in the shared cache 102 b for exclusive use to cache data relating to execution of application 104 c (e.g., application data code 103 a and/or application runtime data 103 b), which is being traced by the tracer 104 a. The request may be made by way of a way-lock request specifying one or more way numbers and/or index/way number combinations. Referring to FIG. 8, for example, ways 0-3 from sets 803 a, 803 b, 803 c, etc. in cache 802 may be reserved for caching the data relating to execution of application 104 c.

In some embodiments, act 901 may comprise locking the cache lines based on a memory address corresponding to a page table for a memory space of the particular executable entity. For example, as mentioned above, there may be a memory address that marks a location in the system memory 801 corresponding to a page table for a memory space of a traced executable entity. The processor(s) 102 may store at least a portion of this memory address in a processor register (e.g., a context register).

Method 900 also includes an act 902 of, during a traced execution, detecting a cache miss on memory of a traced executable entity, and that a memory value is cache into a reserved cache line. Act 902 can comprise, during a traced execution of the particular executable entity, detecting that a cache miss has occurred on a location in the system memory that is allocated to a particular executable entity, and that a value at the location of system memory has been, or is to be, cached into one of the locked cache lines. For example, one or more of the tracer 104 a or the microcode 102 c may detect a cache miss on an address in the application runtime data 103 b in system memory 103. As such, data stored at this address is cached in a reserved line in the shared cache 102 b. Referring to FIG. 8 as an example, a memory access by application 104 c may cause a cache miss on an address corresponding to the traced entity (e.g., an address in addresses 804 a and 804 a′). As such, a value stored at this address is stored in one of the reserved cache lines.

In some embodiments, detecting the cache miss is performed in reference to a processor register (context register) that stores a portion of a memory address corresponding to a page table for a memory space of the particular executable entity.

Method 900 also includes an act 903 of, based on the value being cached into the reserved cache line, logging the value into a trace data stream. Act 903 can comprise, based at least on the value at the location of system memory being cached into one of the locked cache lines, logging into a trace data stream at least a portion of the value at the location of system memory being cached into the one of the locked cache lines. For example, the tracer 104 a may store the value cached in act 902 into a data stream in trace file 104 d. Act 903 may also comprise logging least a portion an address of the memory location cached in act 902.

Some embodiments may comprise a computing device, such as a processor 102, having control logic configured to operate in connection with a tracer 104 a. In these embodiments the computing device can comprise one or more processing units (e.g., processing units 102 a) and a processor cache that has a plurality of cache lines (e.g., shared cache 102 b). The computing device can comprise stored control logic (e.g., microcode 102 c) that facilitates recording a trace of code execution using a processor cache.

The stored control logic may be configured to group the plurality cache lines into a plurality of sets of cache lines, each set comprising two or more different cache lines. For example, the microcode 102 c may group lines of the shared cache 102 b in an N-way set-associative manner, with N equal to or grater than two, such as those illustrated in FIGS. 7B and 8.

The stored control logic may also be configured to, based upon a request, lock one or more cache lines in one or more of the plurality of sets of cache lines for caching only locations in system memory associated with a traced executable entity. For example, the microcode 102 c may be configured to lock or reserve one or more ways in the set-associative cache 102 b, such as reserving four of eight ways as shown in FIG. 8 as an example. By locking these ways, they are used exclusively to store cache misses for reads on memory relating to a particularly-defined executable entity. As discussed above, the locations in system memory associated with the traced executable entity may be identified based on one or more of a memory address identifying a page table of the traced executable entity, an execution context (e.g., user mode or kernel mode), a page table group, etc.

The stored control logic may also be configured to detect a cache miss on a particular location in the system memory that is identified based upon the memory address associated with the traced executable entity. For example, the microcode 102 c may be configured to detect a cache miss based on at least a portion of an address that corresponds to a page table for a memory space of the particularly-defined executable entity.

The stored control logic may also be configured to, as a result of detecting the cache miss, cache a value at the particular location in the system memory and initiate logging of the value at the particular location in the system memory into a log file associated with tracing of the traced executable entity. For example, the microcode 102 c may be cache a value at the memory location that was the subject of the cache miss in an appropriate reserved cache location, and report this to the tracer 104 a for logging in trace file 104 d.

Those of ordinary skill in the art will recognize, in view of the disclosure herein, that each of the techniques described herein are applicable to logging cache misses to each of code caches, translation lookaside buffer (“TLB”) caches, and data caches. Additionally, the techniques described herein apply to both logging raw cached information, as well as data that has been transformed. Example transformations include compression of data, obfuscation of information, etc. For example, the physical address of a memory page may be obfuscated via hashing, or some other transformation, when logging TLB entries in a user mode trace.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above, or the order of the acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims.

The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope. 

What is claimed:
 1. A computer system, comprising: one or more processing units of a processor; a processor cache; and one or more computer-readable media having stored thereon computer-executable instructions that are executable by at least one of the one or more processing units to cause the computer system to reuse a related thread's cache during tracing, the computer-executable instructions including instructions that are executable to cause the computer system to perform at least the following: execute a first thread at a particular processing unit of the one or more processing units while recording a trace of execution of the first thread to a first buffer; detect a context switch from the first thread to a second thread executing at the particular processing unit; based at least on detecting the context switch, determine that the second thread is related to the first thread and that it is being traced to a second buffer that is separate from the first buffer; and based at least on the second thread being related to the first thread and being traced to the second buffer, reuse a cache of the first thread, including: recording a first identifier in the first buffer; recording a second identifier in the second buffer, the first and second identifiers providing a linkage between the first buffer and the second buffer; and initiating execution of the second thread at the particular processing unit while recording a trace of execution of the second thread to the second buffer and without invalidating a logging state of the processor cache.
 2. The computer system of claim 1, the computer-executable instructions also including instructions that are executable to cause the computer system to perform at least the following when a write is performed by the second thread: set a unit bit in the processor cache, the unit bit corresponding to the particular processing unit and a cache line affected by the write; or set one or more index bits in the processor cache to an index of the particular processing unit, the one or more index bits corresponding to the cache line.
 3. The computer system of claim 1, wherein the first identifier and the second identifier are the same identifier.
 4. The computer system of claim 1, wherein the first and second identifiers enable the second thread to use the first buffer during replay of the second thread.
 5. The computer system of claim 1, wherein the first and second identifiers are unique within the first and second buffers.
 6. The computer system of claim 1, wherein the second thread is related to the first thread when they are both part of the same process.
 7. The computer system of claim 1, the computer-executable instructions also including instructions that are executable to cause the computer system to perform at least the following: detect a context switch from the second thread to a third thread executing at the particular processing unit; based at least on detecting the context switch, determine that the third thread is not being traced; and based at least on determining that the third thread is not being traced, perform at least the following when a write is performed by the third thread: clear a unit bit in the processor cache, the unit bit corresponding to the particular processing unit and a cache line affected by the write; or set one or more index bits in the processor cache to a reserved value, the one or more index bits corresponding to the cache line.
 8. A method, implemented at a computer system that includes one or more processing units of a processor and a processor cache, for reusing a related thread's cache during tracing, the method comprising: executing a first thread at a particular processing unit of the one or more processing units while recording a trace of execution of the first thread to a first buffer; detecting a context switch from the first thread to a second thread executing at the particular processing unit; based at least on detecting the context switch, determining that the second thread is related to the first thread and that it is being traced to a second buffer that is separate from the first buffer; and based at least on the second thread being related to the first thread and being traced to the second buffer, reusing a cache of the first thread, including: recording a first identifier in the first buffer; recording a second identifier in the second buffer, the first and second identifiers providing a linkage between the first buffer and the second buffer; and initiating execution of the second thread at the particular processing unit while recording a trace of execution of the second thread to the second buffer and without invalidating a logging state of the processor cache.
 9. The method of claim 8, further comprising, when a write is performed by the second thread: setting a unit bit in the processor cache, the unit bit corresponding to the particular processing unit and a cache line affected by the write; or setting one or more index bits in the processor cache to an index of the particular processing unit, the one or more index bits corresponding to the cache line.
 10. The method of claim 8, wherein the first identifier and the second identifier are the same identifier.
 11. The method of claim 8, wherein the first and second identifiers enable the second thread to use the first buffer during replay of the second thread.
 12. The method of claim 8, wherein the first and second identifiers are unique within the first and second buffers.
 13. The method of claim 8, wherein the second thread is related to the first thread when they are both part of the same process.
 14. The method of claim 8, further comprising: detecting a context switch from the second thread to a third thread executing at the particular processing unit; based at least on detecting the context switch, determining that the third thread is not being traced; and based at least on determining that the third thread is not being traced, performing at least the following when a write is performed by the third thread: clearing a unit bit in the processor cache, the unit bit corresponding to the particular processing unit and a cache line affected by the write; or setting one or more index bits in the processor cache to a reserved value, the one or more index bits corresponding to the cache line.
 15. A computing device that reuses a related thread's cache during tracing, the computing device comprising: one or more processing units; a cache used by the one or more processing units; and stored control logic that is configured to: execute a first thread at a particular processing unit of the one or more processing units while sending a trace of execution of the first thread to a first buffer; detect a context switch from the first thread to a second thread executing at the particular processing unit; based at least on detecting the context switch, determine that the second thread is related to the first thread and that it is being traced to a second buffer that is separate from the first buffer; and based at least on the second thread being related to the first thread and being traced to the second buffer, reuse a cache of the first thread, including: recording a first identifier in the first buffer; recording a second identifier in the second buffer, the first and second identifiers providing a linkage between the first buffer and the second buffer; and initiating execution of the second thread at the particular processing unit while sending a trace of execution of the second thread to the second buffer and without invalidating a logging state of the cache.
 16. The computing device of claim 15, wherein the stored control logic is also configured to perform at least the following when a write is performed by the second thread: set a unit bit in the cache, the unit bit corresponding to the particular processing unit and a cache line affected by the write; or set one or more index bits in the cache to an index of the particular processing unit, the one or more index bits corresponding to the cache line.
 17. The computing device of claim 15, wherein the first identifier and the second identifier are the same identifier.
 18. The computing device of claim 15, wherein the first and second identifiers enable the second thread to use the first buffer during replay of the second thread.
 19. The computing device of claim 15, wherein the first and second identifiers are unique within the first and second buffers.
 20. The computing device of claim 15, wherein the stored control logic is also configured to: detect a context switch from the second thread to a third thread executing at the particular processing unit; based at least on detecting the context switch, determine that the third thread is not being traced; and based at least on determining that the third thread is not being traced, perform at least the following when a write is performed by the third thread: clear a unit bit in the cache, the unit bit corresponding to the particular processing unit and a cache line affected by the write; or set one or more index bits in the cache to a reserved value, the one or more index bits corresponding to the cache line. 